public class Solution {
public void sortColors(int[] nums) {
if (nums == null || nums.length <= 1) {
return;
}
int left = 0;
int right = nums.length - 1;
int cur = 0;
while (cur <= right) {
if (nums[cur] == 0) {
swap(nums, cur, left);
left++;
cur++;
} else if (nums[cur] == 2) {
swap(nums, cur, right);
right--;
} else {
cur++;
}
}
return;
}
public void swap(int[] nums, int a, int b) {
int tmp = nums[a];
nums[a] = nums[b];
nums[b] = tmp;
}
}
Sort Numbers. 把 0 都放最前面,1 都放最后面。
/**
* Created by yang on 1/4/17.
*/
public class Solution8 {
public static void sortNumber(int[] nums) {
if (nums == null || nums.length == 0) {
return;
}
int left = 0, right = nums.length - 1;
int cur = 0;
while (cur <= right) {
if (nums[cur] == 0) {
swap(nums, left, cur);
left++;
cur++;
} else if (nums[cur] == 1) {
swap(nums, right, cur);
right--;
} else {
cur++;
}
}
return;
}
private static void swap(int[] nums, int i, int j) {
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
}
public static void main(String[] args) {
int[] nums = new int[]{5, 4, 0, 1, 1, 2, 0, 9, 0, 1};
sortNumber(nums);
for (int i : nums) {
System.out.print(i + " ");
}
}
}