题目描述题解(三指针)思路详解1代码classSolution{publicvoidsortColors(int[]nums){intnnums.length;intp00;intp2n-1;intcurr0;while(currp2){if(nums[curr]0){swap(nums,p0,curr);p0;curr;}elseif(nums[curr]2){swap(nums,p2,curr);p2--;}else{curr;}}}privatevoidswap(int[]arr,inti,intj){inttmparr[i];arr[i]arr[j];arr[j]tmp;}}复杂度分析时间复杂度:O(N)O(N)O(N),能够在一次遍历中完成排序空间复杂度:O(1)O(1)O(1)