75. Sort Colors
来源:互联网 发布:js 图片跟随鼠标移动 编辑:程序博客网 时间:2024/06/18 18:48
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 swap(int[] nums, int i, int j){ int tmp = nums[i]; nums[i] = nums[j]; nums[j] = tmp; } public void sortColors(int[] nums) { int left = 0, right = nums.length - 1; for (int i = 0; i <= right; ++ i){ if (nums[i] == 0){ swap(nums, i, left); left ++; } if (nums[i] == 2){ while (right >= 0&&nums[right] == 2){ right -- ; } if (i < right){ swap(nums, i, right); } if (nums[i] == 0){ i --; } } } }}
阅读全文
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
- android模拟数据实现全选反选批量删除
- FT,FS,DTFT,DFS,DFT,FFT的区分
- HDOJ2071 Max Num
- RSA AES 前端JS与后台JAVA的加密解密的是实现
- springMVC 的工作原理和机制
- 75. Sort Colors
- VIP视频解析
- Android 透明状态栏
- Collection接口和迭代器
- CS231n学习笔记--14. Reinforcement Learning
- 约瑟夫问题
- Spring工程,测试类编写demo
- IE9下MP3音频倍速播放及调整音量存在延迟的可能原因
- HttpClient实现远程调用