LeeCode-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.

Note:
You are not suppose to use the library's sort function for this problem.

 void sortColors(int* nums, int numsSize)

 {

         if(numsSize==||nums==NULL)

         return;

     if(numsSize==)

         return;

     int red=,white=,blue=;

     for(int i=;i<numsSize;i++)

     {

         if(nums[i]==)

             red++;

         if(nums[i]==)

             white++;

         if(nums[i]==)

             blue++;

     }

     for(int i=;i<numsSize;i++)

     {

         if(i<red)

         {

             nums[i]=;

         }

         if(i>=red&&i<(red+white))

         {

             nums[i]=;

         }

         if(i>=(red+white)&&i<numsSize)

         {

             nums[i]=;

         }

     }

 }

巴特西

LeeCode-Sort Colors

最新文章

热门文章