[leetcode]Sort Colors
来源:互联网 发布:淘宝虚假交易处罚 编辑:程序博客网 时间:2024/06/10 07:19
问题描述:
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.
基本思想:
遍历一遍记录0,1,2的个数,然后利用计数排序写出代码。
代码:
void sortColors(int A[], int n) { //C++ int rNum =0,wNum = 0, bNum =0; for(int i = 0; i < n; i++){ if(A[i] == 0) rNum++; else if(A[i] == 1) wNum++; else bNum++; } int rBegin = 0; int wBegin = rNum; int bBegin = rNum+wNum; //ith element i < rNum for(int i = 0; i < n; i++){ if(i < rNum) A[i] =0; else if(i < n-bNum) A[i] = 1; else A[i] =2; } }
one-pass algorithm
void sortColors(int[] A) { int i=-1, j=-1, k=-1; for(int p = 0; p < A.length; p++) { if(A[p] == 0) { A[++k]=2; A[++j]=1; A[++i]=0; } else if (A[p] == 1) { A[++k]=2; A[++j]=1; } else if (A[p] == 2) { A[++k]=2; } }}
0 0
- LeetCode: Sort Colors
- LeetCode Sort Colors
- LeetCode : Sort Colors
- leetcode 77: Sort Colors
- Leetcode 75 Sort Colors
- leetcode 101: Sort Colors
- [LeetCode]Sort Colors
- [leetcode]Sort Colors
- LeetCode-Sort Colors
- [leetcode] Sort Colors
- [LeetCode] Sort Colors
- [leetCode] Sort Colors
- LeetCode - Sort Colors
- leetcode:Sort Colors
- LeetCode | Sort Colors
- 【LeetCode】Sort Colors
- Leetcode: Sort Colors
- [LeetCode] Sort Colors
- POJ2104 K-th Number 【归并树】
- 第12周项目1.1.1
- Visual C++ 基本原理
- C++堆 和 栈 空间的区别
- 泛型练习3
- [leetcode]Sort Colors
- 第十二周项目一——阅读程序(1)
- CSipSimple结构浅析
- VB.net 类型转换问题
- ExtJs--09--javascript对象的方法的3种写法 prototype通过原型设置方法效率最好
- opencv Delaunay三角剖分例子
- java-javabean Introspector的应用
- poj 1850&&1496
- 可拖拽GridView代码解析