75. Sort Colors
来源:互联网 发布:数据库笔试题及答案 编辑:程序博客网 时间:2024/05/21 10:53
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.
click to show follow up.
Follow up:
A rather straight forward solution is a two-pass algorithm using counting sort.
First, iterate the array counting number of 0's, 1's, and 2's, then overwrite array with total number of 0's, then 1's and followed by 2's.
Could you come up with an one-pass algorithm using only constant space?
官方代码:
class Solution { public: void sortColors(int A[], int n) { int second=n-1, zero=0; for (int i=0; i<=second; i++) { while (A[i]==2 && i<second) swap(A[i], A[second--]); while (A[i]==0 && i>zero) swap(A[i], A[zero++]); } } };
阅读全文
0 0
- 【sort专题】75. Sort Colors
- 75. Sort Colors
- [LeetCode]75.Sort Colors
- LeetCode --- 75. Sort Colors
- [Leetcode] 75. Sort Colors
- [leetcode] 75.Sort Colors
- 75. Sort Colors
- 【leetcode】75. Sort Colors
- 75. Sort Colors
- [leetcode] 75. Sort Colors
- Leetcode 75. Sort Colors
- *LeetCode 75. Sort Colors
- 75. Sort Colors LeetCode
- 75. Sort Colors
- Leetcode 75. Sort Colors
- 75. Sort Colors
- [LeetCode]75. Sort Colors
- 75. Sort Colors
- 前文
- partition-list
- Spring与mybatis整合
- 匈牙利命名规则
- Js和Jquery中html(),html(值),val()和val(值)的区别
- 75. Sort Colors
- Parcelable, Serializable,Cloneable,copyProperties
- codeforces 27E Number With The Given Amount Of Divisors
- Misc-Xp0int(数据包分析)
- thinkphp(1)关联模型学习
- 技术人生——新的开始
- [知了堂学习笔记]_jQuery 事件参考手册
- 2017阿里云双十一优惠红包代金券领取
- Setting-->About phone-->Build number浅析