回答思路

class Solution { public: int *sort(int *a,int lenA,int *b,int lenB){ fastSort(a,0,lenA); fastSort(b,0,lenB); return merge(a,lenA,b,lenB); } private: //快速排序 void fastSort(int *a,int start,int end){ if(a==NULL || end-start<=1 || start<0) return; int pivotPos = start; int pivot = a[start]; int temp; for(int i=start+1;i