75. Sort Colors

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?

Runtime: 0 ms, faster than 100.00% of Java online submissions for Sort Colors.

Memory Usage: 37.3 MB, less than 0.93% of Java online submissions for Sort Colors.

难度:medium

题目:给定一数组表示红,白,蓝三种颜色,原地排序使得相同颜色的物体相邻。

思路:

  1. counting sort
  2. 使用左右置换指针

counting sort

class Solution {
    public void sortColors(int[] nums) {
        int[] colors = {0, 0, 0};
        for (int i = 0; i < nums.length; i++) {
            colors[nums[i]]++;
        }
        for (int i = 0; i < nums.length;) {
            for (int j = 0; j < colors.length; j++) {
                for (int k = 0; k < colors[j]; k++) {
                    nums[i++] = j;
                }
            }
        }
    }
}

左右指针置换

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

原文 

https://segmentfault.com/a/1190000018131642

本站部分文章源于互联网,本着传播知识、有益学习和研究的目的进行的转载,为网友免费提供。如有著作权人或出版方提出异议,本站将立即删除。如果您对文章转载有任何疑问请告之我们,以便我们及时纠正。

PS:推荐一个微信公众号: askHarries 或者qq群:474807195,里面会分享一些资深架构师录制的视频录像:有Spring,MyBatis,Netty源码分析,高并发、高性能、分布式、微服务架构的原理,JVM性能优化这些成为架构师必备的知识体系。还能领取免费的学习资源,目前受益良多

转载请注明原文出处:Harries Blog™ » 75. Sort Colors

赞 (0)
分享到:更多 ()

评论 0

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址