摘要:
1 class Solution 2 { 3 public: 4 void sortColors(vector<int>& nums) 5 { 6 int n = nums.size(); 7 int begin = -1; 8 int end = n; 9 int i = 0; 10 while( 阅读全文
摘要:
1 void partition(int arr[], int l, int r, int num)//三路快排 2 { 3 int less = l - 1; 4 int more = r + 1; 5 int cur = 0; 6 while (cur < more) 7 { 8 if (arr 阅读全文