75. Sort Colors

最新推荐文章于 2020-07-31 06:04:33 发布

Queen_Bey

最新推荐文章于 2020-07-31 06:04:33 发布

阅读量143

点赞数

分类专栏：刷题

本文链接：https://blog.csdn.net/Queen_Bey/article/details/79566621

版权

刷题专栏收录该内容

126 篇文章 0 订阅

订阅专栏

public void sortColors( int[] nums) { // 1-pass int p1 = 0, p2 = nums.length - 1, index = 0; while ( index <= p2) { if (nums[ index] == 0) { nums[ index] = nums[p1]; nums[p1] = 0; p1++; } if (nums[ index] == 2) { nums[ index] = nums[p2]; nums[p2] = 2; p2--; index--; } index++; } }

public void sortColors(int[] nums) {
    // 2-pass
    int count0 = 0, count1 = 0, count2 = 0;
    for (int i = 0; i < nums.length; i++) {
        if (nums[i] == 0) {count0++;}
        if (nums[i] == 1) {count1++;}
        if (nums[i] == 2) {count2++;}
    }
    for(int i = 0; i < nums.length; i++) {
        if (i < count0) {nums[i] = 0;}
        else if (i < count0 + count1) {nums[i] = 1;}
        else {nums[i] = 2;}
    }
}