public class Solution {
public void sortColors(int[] nums) {
if (nums == null || nums.length < 2) {
return;
}
int i = 0, p0 = 0, p2 = nums.length - 1;
while (i <= p2) {
if (nums[i] == 0) {
swap(i, p0, nums);
i++;
p0++;
} else if (nums[i] == 1) {
i++;
} else {
swap(i, p2, nums);
p2--;
}
}
return;
}
private void swap(int i, int j, int[] nums) {
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}
Sort Colors
最新推荐文章于 2021-04-15 12:30:39 发布