LeetCode 75 Sort Colors (思维)

最新推荐文章于 2021-12-23 23:39:18 发布

_TCgogogo_

最新推荐文章于 2021-12-23 23:39:18 发布

阅读量96

点赞数

分类专栏： Leetcode Medium LeetCode 文章标签：思维

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/89297590

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Medium

244 篇文章 0 订阅

订阅专栏

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]

Follow up:

A rather straight forward solution is a two-pass algorithm using counting sort.
First, iterate the array counting number of 0's, 1's, and 2's, then overwrite array with total number of 0's, then 1's and followed by 2's.
Could you come up with a one-pass algorithm using only constant space?

题目链接：https://leetcode.com/problems/sort-colors/

题目分析：经典问题，当前位置为2和末尾交换后指针不后移，因为若末尾为0或2，还需对当前位置进行二次置换

0ms，时间击败100%

class Solution {
    
    public void swap(int[] nums, int i, int j) {
        int tmp = nums[i];
        nums[i] = nums[j];
        nums[j] = tmp;
    }
    
    public void sortColors(int[] nums) {
        int left = 0, right = nums.length - 1, i = 0;
        while (i <= right) {
            if (nums[i] == 2) {
                swap(nums, i, right--);
            } else if (nums[i] == 0) {
                swap(nums, left++, i++);
            } else {
                i++;
            }
        }
    }
}