[LeetCode]75. Sort Colors

Given an array with n objects colored red, white or blue, sort them 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.

思路：设置两个指针，一个指向数组的头，另一个指向数组的尾部

从数组的第一位开始搜索，若当前值时0，则与第一个指针指向的值交换，第一个指针后移一位

若当前值等于2，则与第二个指针指向的值交换，第二个指针前移

直到遍历数组的所有元素

public class Solution {
    public void sortColors(int[] nums) { 
        int m=0,n=0,p=nums.length-1;
      while(n<=p)
       {
           if(nums[n] == 0){
               int temp = 0;
               temp = nums[n];
               nums[n] = nums[m];
               nums[m] = temp;
               m++;
               n++;
           }else if(nums[n] == 2){
               int temp = 0;
               temp = nums[p];
               nums[p] = nums[n];
               nums[n] = temp;
               p--;
           }else{
               n++;
           }
       }
    }
}