Leetcode
来源:互联网 发布:淘宝店铺ip地址怎么查 编辑:程序博客网 时间:2024/05/18 18: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.
解析
class Solution01 { public void sortColors(int[] nums) { //计数排序思路: //创建一个数组count用来统计0,1,2出现的次数 //然后将0,1,2按顺序传值进原数组 int count[] = new int[3]; for(int n : nums){ count[n]++; } int index = 0; for(int j = 0; j < 3; j++){ for(int i = 0; i < count[j] ; i++){ nums[index++] = j; } } }}
阅读全文
0 0
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode:
- leetcode
- Android:ScrollView起始位置不是最顶部
- CI持续集成系统 jira + jenkins + gerrit
- codeforces 754D Fedor and coupons【优先队列+贪心*好题】
- Android AOP之路四 编译时注解详细讲解
- 彻底搞懂四元数
- Leetcode
- centos上部署kubernetes集群
- 堆排序原理及算法实现(Java)
- JQuery中$.ajax()方法参数详解
- 关于this kernel requires an x86-64 cpu but only detected an i686 cpu unable to boot please use a kern
- savon调用WebService服务
- acm之路
- 图的深搜
- android优化-UI优化总结