Leetcode 75: Sort Colors
Posted Keep walking
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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.
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的主要内容,如果未能解决你的问题,请参考以下文章