[leetcode]75. Sort Colors(Java)
来源:互联网 发布:淘宝ulzzang什么意思 编辑:程序博客网 时间:2024/05/17 08:19
https://leetcode.com/problems/sort-colors/#/description
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.
package go.jacob.day629;public class Demo2 {/* * 桶排序 Runtime: 0 ms.Your runtime beats 61.03 % of java submissions. * 需要申请O(n)额外空间。 time:O(n). */public void sortColors(int[] nums) {int[] count = new int[3];for (int i = 0; i < nums.length; i++) {if (nums[i] == 0)count[0]++;else if (nums[i] == 1)count[1]++;elsecount[2]++;}int index = 0;for (int i = 0; i < count[0]; i++) {nums[index++] = 0;}for (int i = 0; i < count[1]; i++) {nums[index++] = 1;}for (int i = 0; i < count[2]; i++) {nums[index++] = 2;}}}
阅读全文
0 0
- leetcode-java-75. Sort Colors
- 【leetcode】75. Sort Colors【java】
- [LeetCode] 75. Sort Colors java
- [leetcode]75. Sort Colors(Java)
- [Leetcode] Sort Colors (Java)
- leetcode Sort Colors java
- [LeetCode][Java] Sort Colors
- leetcode:Sort Colors 【Java】
- Sort Colors leetcode java
- LeetCode-75. Sort Colors (JAVA)三色排序
- [LeetCode]75.Sort Colors
- LeetCode --- 75. Sort Colors
- [Leetcode] 75. Sort Colors
- [leetcode] 75.Sort Colors
- 【leetcode】75. Sort Colors
- [leetcode] 75. Sort Colors
- Leetcode 75. Sort Colors
- *LeetCode 75. Sort Colors
- CNTK API文档翻译(5)——对MNIST数据使用逻辑回归
- 全面介绍Windows内存管理机制及C++内存分配实例(二):内存状态查询
- 练习 2-2 在不使用运算符&&或||的条件下编写一个与上面的for 循环语句等价的循环语句。
- 继承hibernateDaoSupport之后通过注解方式注入SessionFactory
- python(1)
- [leetcode]75. Sort Colors(Java)
- 常量指针和指针常量的区别详解
- ios 基础数据持久化存储
- 脚本实现U盘自动挂载(linux平台)
- Go语言的类IPython 交互式编程界面
- butterknife详细使用及混淆打包和新版本(8.6.0)的使用方法
- Mybatis 多表关联查询,快速添加返回类型
- 全面介绍Windows内存管理机制及C++内存分配实例(三):虚拟内存
- 地址栏搜索参数转为对象