LeetCode 75 Sort Colors
来源:互联网 发布:网络维护兼职工资 编辑:程序博客网 时间:2024/06/11 13: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.
方法一:
public void sortColors(int[] nums) {int red = 0, blue = nums.length - 1, i = 0;while (i <= blue) {int tmp;/**0排到前面,2排到后面*/if (nums[i] == 0) {tmp = nums[i];nums[i++] = nums[red];nums[red++] = tmp;} else if (nums[i] == 2) {tmp = nums[i];nums[i] = nums[blue];nums[blue--] = tmp;} else i++;}}
方法二:
public void sortColors2(int[] nums) {int[] count = new int[3];for (int i = 0; i < nums.length; i++)count[nums[i]]++;for (int i = 0, index = 0; i < 3; i++)for (int j = 0; j < count[i]; j++)nums[index++] = i;}方法三:
public void sortColors3(int[] nums) {int l = 0, m = 0, n = 0;for (int i = 0; i < nums.length; i++) {if (nums[i] == 0) {nums[n++] = 2;nums[m++] = 1;nums[l++] = 0;} else if (nums[i] == 1) {nums[n++] = 2;nums[m++] = 1;} else nums[n++] = 2;}}
0 0
- 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
- Leetcode 75Sort Colors
- Sort Colors - LeetCode 75
- 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
- 动物叫 2
- jsoup抓取js(script)中的变量值
- 《剑指offer》:[4]合并两个单链表
- Dubbo架构设计详解
- 赶快使用Q-Dir软件,使您的文件夹操作更加高效
- LeetCode 75 Sort Colors
- 使用ConcurrentHashMap的原因
- Minimum Size Subarray Sum
- 响应式布局
- 实习入职第五天:参数中的可变参数等小知识点
- win32中GBK、UTF8的互转
- AVFoundation自定义相机
- 初学opencv
- this和getApplicationContext区别