package zuosuanfa; public class Day02 { public static int[] partition(int[]arr, int L,int R,int num){//L是左边界 num是指定数值 int less = L-1; int more = R + 1; int cur = L; while (L<more){ if( arr[cur]<num){ swap(arr,cur++,++less); }if(arr[cur]>num){ swap(arr,cur,--more); }else{ cur++; } }return new int[]{less+1 ,more-1}; } public static void swap(int []arr , int i , int j){ int tem = arr[i] ; arr[i]=arr[j]; arr[j]=tem; } }
荷兰旗问题
最新推荐文章于 2021-11-27 20:15:48 发布