6.7—排序—Sort Colors
来源:互联网 发布:儿童初学画画软件 编辑:程序博客网 时间:2024/06/05 05:25
描述
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.
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?
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.
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?
#include<iostream>using namespace std;//遍历一遍数组,将0,1,2,0,2,1,0,0,1,2,1,0等这类数字排序inline void swap(int &a, int &b){int c = a;a = b;b = c;}void SortColors(int a[], int n){int index = 0;int pbegin = 0;int pend = n - 1;for (index = 0; index < pend;){if (a[index] == 0){swap(a[index], a[pbegin]);index++;pbegin++;}else if (a[index] == 2){swap(a[index], a[pend]);pend--;}else{index++;}}}int main(){const int n = 10;int a[n] = { 1, 2, 0, 0, 2, 2, 1, 1, 1, 0 };SortColors(a, n);for (int i = 0; i < n; i++)cout << a[i] << " ";cout << endl;}
阅读全文
0 0
- 6.7—排序—Sort Colors
- Sort Colors —LeetCode
- Leetcode刷题记——75. Sort Colors(颜色排序)
- Sort Colors 颜色排序
- 【排序】Sort Colors
- LeetCode Sort Colors(排序)
- Sort Colors 三色排序
- LeetCode-Sort Colors-排序
- LeetCode —— Sort Colors
- LeetCode——Sort Colors
- LeetCode——Sort Colors
- LeetCode75——Sort Colors
- 数组——sort colors
- Algorithms—75.Sort Colors
- Sort Colors 排序颜色 @LeetCode
- leetcode:sort colors排序颜色
- 【LeetCode】Sort Colors 数组排序
- Sort Colors 哈希排序
- NAT穿透解决方案介绍
- Java
- iReport 4.1 报表、子报表、主从报表、合计、实例解析
- EasyUi+Spring Data 实现按条件分页查询
- h264 rtp FU-A
- 6.7—排序—Sort Colors
- 【基础算法练习】【最短路+图的遍历+最小生成树】水题 C+ E+ F-----AC题
- 迪杰斯特拉最短路径算法
- PAT 1002. A+B for Polynomials
- SpringMVC IOC DI接口版本管理(迭代版)
- 7.1—查找—Sear for a Range
- HDU 1535 Invitation Cards(多源点到单源点,dijkstra/spfa)
- 闲记
- typedef