AlgorithmJourney/LeetCode/LeetCode75.java at main · HenryJi529/AlgorithmJourney · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
import java.util.Arrays;

import util.PrintUtil;

public class LeetCode75 {
    public static void main(String[] args) {
        int[] nums;
        // 输入：nums = [2,0,2,1,1,0]
        // 输出：[0,0,1,1,2,2]
        nums = new int[] { 2, 0, 2, 1, 1, 0 };
        System.out.println(Arrays.toString(nums));
        new Solution75().sortColors(nums);
        System.out.println(Arrays.toString(nums));
        PrintUtil.printDivider();

        // 输入：nums = [2,0,1]
        // 输出：[0,1,2]
        nums = new int[] { 2, 0, 1 };
        System.out.println(Arrays.toString(nums));
        new Solution75().sortColors(nums);
        System.out.println(Arrays.toString(nums));
        PrintUtil.printDivider();

        // 输入：nums = [1,2,0]
        // 输出：[0,1,2]
        nums = new int[] { 1, 2, 0 };
        System.out.println(Arrays.toString(nums));
        new Solution75().sortColors(nums);
        System.out.println(Arrays.toString(nums));
        PrintUtil.printDivider();
    }
}

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