没什么好说的想不到中等的题居然是直接暴力。。。这里并没有用任何办法
class Solution {
public int partitionDisjoint(int[] A) {
int i,j;
i = j = 0;
for(;j < A.length;j++) {
int max = -1;
int min = 1000001;
for(i = 0;i <= j;i++)
if(A[i] > max)
max = A[i];
for(i = j + 1;i < A.length;i++)
if(A[i] < min)
min = A[i];
if(max <= min)
break;
}
j++;
return j;
}
}