---

• 原題鏈接：75. 顏色分類

---

1- 思路

題目識別

• 識別1 ：給定三種類型數(shù)據(jù)，使得三種數(shù)據(jù)用一次遍歷實現(xiàn)三種數(shù)據(jù)排序。

技巧

• 用兩條線將數(shù)組分為三部分
• A 線左側(cè)，保證數(shù)據(jù)都為 0 ；B 線右側(cè)保證元素都是 2。

---

2- 實現(xiàn)

?75. 顏色分類——題解思路

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

---

3- ACM 實現(xiàn)

public class sortColors {public static void sortC(int[] nums){int left = 0;int right = nums.length-1;for(int i = 0 ; i <= right;i++){if(nums[i] == 0){swap(nums,i,left++);}else if(nums[i] == 2){swap(nums,i--,right--);}}}private static void swap(int[] nums,int i ,int j){int tmp = nums[i];nums[i] = nums[j];nums[j] = tmp;}public static void main(String[] args) {Scanner sc = new Scanner(System.in);String input = sc.nextLine();input = input.replace("[","").replace("]","");String[] parts = input.split(",");int[] nums = new int[parts.length];for(int i= 0 ; i < nums.length;i++){nums[i] = Integer.parseInt(parts[i]);}sortC(nums);System.out.println("結(jié)果是");for(int i : nums){System.out.print(i+" ");}}
}