题解 | [Galadriel]#牛群的排序##C++#

#include <type_traits>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型vector 
     * @return int整型vector
     */
    //function of QuickSort
    void QuickSort(vector<int>& nums, int start, int end){
        if(start>=end) return;
        int left = start;
        int right = end;
        int pivot = nums[start];
        while(left<right){
            while(left<right && nums[right]>=pivot) right--;
            nums[left] = nums[right];
            while(left<right && nums[left]<=pivot)  left++;
            nums[right]=nums[left];
        }
        nums[left] = pivot;
        QuickSort(nums, start, left-1);
        QuickSort(nums, left+1, end);
    }
    vector<int> sortCows(vector<int>& nums) {
        QuickSort(nums, 0, nums.size()-1);
        return nums;
    }
};