leetcode 75. Sort Colors

题意

排序。

题解

如题。直接使用STL的sort就可以过。

代码

“`c++
class Solution {
public:
int patition(vector &nums, int low, int high)
{
int key = nums[low];
int swapPos = low;
for(int i = low + 1; i <= high; i++)
{
if(nums[i] <= key)
swap(nums[++swapPos], nums[i]);
}
swap(nums[swapPos], nums[low]);
return swapPos;
}
void quick_sort(vector &nums, int low, int high)
{
if(low < high)
{
int mid = patition(nums, low, high);
quick_sort(nums, low, mid - 1);
quick_sort(nums, mid + 1, high);
}
}
void sortColors(vector& nums) {
//sort(nums.begin(), nums.end());
quick_sort(nums, 0, nums.size() - 1);

}

};