class Solution { public: //快排的划分函数 int Divide(vector<int>& arr, int left, int right) { int tmp = arr[left]; while (left < right) { while (left < right && tmp < arr[right]) --right; if (left < right) arr[left] = arr[right]; ...