Leetcode75. Color Classification

题目传送地址：https://leetcode.cn/problems/sort-colors/

运行效率

代码如下：

class Solution {
    
      public static void sortColors(int[] nums) {
    
        //Find the first one from left to right2, At the same time, look for the first ratio from right to left2小的数,然后交换位置
        int i = 0;
        int j = nums.length - 1;
        while (i < j) {
    
            while (i < nums.length) {
    
                if (nums[i] == 2) {
    
                    break;
                }
                i++;
            }
            while (j >= 0) {
    
                if (nums[j] < 2) {
    
                    break;
                }
                j--;
            }
            if (i < j) {
    
                swap(i, j, nums);
            }
        }
        //经过上面的代码,现在所有的2have been placed at the end of the array
        //Next, we will0和1进行位置调整
        i = 0;
        j = nums.length - 1;
        while (i < j) {
    
            while (i < nums.length) {
    
                if (nums[i] == 1) {
    
                    break;
                }
                i++;
            }
            while (j >= 0) {
    
                if (nums[j] == 0) {
    
                    break;
                }
                j--;
            }
            if (i < j) {
    
                swap(i, j, nums);
            }
        }
    }

    public static void swap(int i, int j, int[] nums) {
    
        int temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
    }
}