题目原址
https://leetcode.com/problems/sort-colors/description/
题目描述
Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.
Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
Note: You are not suppose to use the library’s sort function for this problem.
Example:
Input: [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]
解题思路
给定一个数组,数组中的元素有三种类型,0 ,1,2,其中0代表红色,1代表白色,2代表蓝色。现要求将数组中的元素按照红白蓝进行排序。
思路:因
- 为题目一共有3种颜色,所以可以归类为两头问题,0代表左边,2代表右边。
- 每遍历一次,如果遍历到的元素为0,则将当前的元素放在左边,将左边的元素放在当前的元素位置,将左边指针向右移动一位。
- 如果遍历到的元素为2时,则将当前的元素放在右边,将右边的元素放在当前的元素位置,将右边指针向左移动一位。注意如果值为2时,则将index当前元素索引值自减1,这样才能保证这次循环index索引值不变,而只更改右边指针。
AC代码
class Solution {
public void sortColors(int[] nums) {
int left = 0, length = nums.length - 1;
int index = 0;
while(index <= length) {
if(nums[index] == 0){
nums[index] = nums[left];
nums[left] = 0;
left ++;
}
if(nums[index] == 2) {
nums[index] = nums[length];
nums[length] = 2;
index --;
length --;
}
index ++;
}
}
}