码迷,mamicode.com
首页 > 其他好文 > 详细

Leetcode 75: Sort Colors

时间:2017-11-11 11:26:36      阅读:173      评论:0      收藏:0      [点我收藏+]

标签:fun   order   cts   log   function   func   present   represent   sort   


 

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.

 
 1 public class Solution {
 2     public void SortColors(int[] nums) {
 3         int c0 = 0, c1 = 0;
 4         
 5         for (int i = 0; i < nums.Length; i++)
 6         {
 7             if (nums[i] == 0)
 8             {
 9                 c0++;
10             }
11             else if (nums[i] == 1)
12             {
13                 c1++;
14             }
15         }
16         
17         for (int i = 0; i < nums.Length; i++)
18         {
19             if (i < c0)
20             {
21                 nums[i] = 0;
22             }
23             else if (i < c1 + c0)
24             {
25                 nums[i] = 1;
26             }
27             else
28             {
29                 nums[i] = 2;
30             }
31         }
32     }
33 }

 

Leetcode 75: Sort Colors

标签:fun   order   cts   log   function   func   present   represent   sort   

原文地址:http://www.cnblogs.com/liangmou/p/7818049.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!