今天做到lc75.颜色分类这道题,复习一下快速排序的写法,之前陪同学面试被问到非递归的快排写法,所以一起记录一下。
- 递归写法
class Solution {
public:
void sortColors(vector<int>& nums) {
quickSort(nums,0,nums.size()-1);
}
void quickSort(vector<int>& nums,int low,int high){
if(low>=high)return;
int i=low;
int j=high;
int key=nums[low];//基准
while(i<j){
while(i<j&&nums[j]>=key)j--;
nums[i]=nums[j];
while(i<j&&nums[i]<=key)i++;
nums[j]=nums[i];
}
nums[i]=key;
quickSort(nums,low,i-1);//递归
quickSort(nums,i+1,high);
}
};
- 非递归写法
递归写法主要在划分区间,非递归写法用一个栈来保存区间即可
class Solution {
public:
void sortColors(vector<int>& nums) {
quickSort(nums,0,nums.size()-1);
}
int partSort(vector<int>&nums,int low,int high){
int i=low;
int j=high;
int key=nums[low];
while(i<j){
while(i<j&&nums[j]>=key)j--;
nums[i]=nums[j];
while(i<j&&nums[i]<=key)i++;
nums[j]=nums[i];
}
nums[i]=key;
return i;
}
void quickSort(vector<int>& nums,int low,int high){
stack<int>stk;
stk.push(low);
stk.push(high);
while(!stk.empty()){
int right=stk.top();
stk.pop();
int left=stk.top();
stk.pop();
int index=partSort(nums,left,right);
if(left<index-1) {
stk.push(left);
stk.push(index-1);
}
if(right>index+1){
stk.push(index+1);
stk.push(right);
}
}
}
};