class Solution {
public void sortColors(int[] nums) {
int zero = 0;
int two = nums.length - 1;
int i = 0;
while( i <= two) {
if (nums[i] == 0) {
swap(nums, zero, i);
zero++;
}
if (nums[i] == 2) {
swap(nums, i, two);
two--;
}
if(nums[i] == 1) {
i++;
}
i = Math.max(i, zero);
}
}
public void swap(int a[], int i, int j) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
07-27