Sort Colors
来源:互联网 发布:怎么才能拥有淘宝水军 编辑:程序博客网 时间:2024/05/18 22:18
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.
双指针,分别记录红色和蓝色。
注意cur指针的递增。
class Solution {public: void sortColors(vector<int>& nums) { int redIndex = 0; int blueIndex = nums.size() - 1; int curIndex = 0; while(curIndex < blueIndex+1) { if(nums[curIndex] == 0) { swap(nums[redIndex++],nums[curIndex++]); } else if(nums[curIndex] == 2) { swap(nums[blueIndex--],nums[curIndex]); } else curIndex++; } }};
0 0
- Sort Colors
- sort colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- Sort Colors
- C语言游戏_弹弹乐(打砖块)
- C++标准库中排序函数sort的用法
- 6.27 洗刷刷 oj 运算符的重载 2+
- JS中遍历普通数组和字典数组的区别
- LAN路由
- Sort Colors
- 基本算法-MD5
- js数组与 json 的区别
- Eclipse快捷键
- redis 工具类
- 二分查找
- C++经典面试题(六)
- SSH公钥认证
- 6.27 洗刷刷 oj 运算符重载 矩阵之和