#75 Sort Colors

最新推荐文章于 2022-04-17 12:59:49 发布

yoyooyooo

最新推荐文章于 2022-04-17 12:59:49 发布

阅读量90

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/YY_Tina/article/details/108823755

版权

leetcode 专栏收录该内容

188 篇文章 0 订阅

订阅专栏

Description

Given an array nums 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.

Follow up:

Could you solve this problem without using the library’s sort function?
Could you come up with a one-pass algorithm using only O(1) constant space?

Examples

Example 1:

Input: nums = [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]

Example 2:

Input: nums = [2,0,1]
Output: [0,1,2]

Example 3:

Input: nums = [0]
Output: [0]

Example 4:

Input: nums = [1]
Output: [1]

Constraints:

n == nums.length
1 <= n <= 300
nums[i] is 0, 1, or 2.

解题思路

记录一下0/1/2出现的次数就可以啦

代码

class Solution {
    public void sortColors(int[] nums) {
        int zero, one, two, i;
        zero = 0;
        one = 0;
        two = 0;
        
        for(i = 0; i < nums.length; i++){
            if(nums[i] == 0){
                zero ++;
                continue;
            }
            if(nums[i] == 1){
                one ++;
                continue;
            }
            if(nums[i] == 2){
                two ++;
                continue;
            }
        }
        
        for(i = 0; i < zero; i++){
            nums[i] = 0;
        }
        for(i = 0; i < one; i++){
            nums[i + zero] = 1;
        }
        for(i = 0; i < two; i++){
            nums[i + zero + one] = 2;
        }
    }
}