luzhipeng 18eec7c Mar 28, 2019
0 contributors

### Users who have contributed to this file

96 lines (81 sloc) 2.83 KB

## 题目地址

https://leetcode.com/problems/sort-colors/description/

## 题目描述

Given an array with n objects colored red, white or blue, sort them in-place 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.

Example:

Input: [2,0,2,1,1,0] Output: [0,0,1,1,2,2] 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 a one-pass algorithm using only constant space?

## 代码

```/*
* @lc app=leetcode id=75 lang=javascript
*
* [75] Sort Colors
*
* https://leetcode.com/problems/sort-colors/description/
*
* algorithms
* Medium (41.41%)
* Total Accepted:    297K
* Total Submissions: 716.1K
* Testcase Example:  '[2,0,2,1,1,0]'
*
* Given an array with n objects colored red, white or blue, sort them in-place
* 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.
*
* Example:
*
*
* Input: [2,0,2,1,1,0]
* Output: [0,0,1,1,2,2]
*
*
*
* 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 a one-pass algorithm using only constant space?
*
*
*/
/**
* @param {number[]} nums
* @return {void} Do not return anything, modify nums in-place instead.
*/
var sortColors = function(nums) {
function swap(nums, i, j) {
const temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
for (let i = 0; i < nums.length - 1; i++) {
for (let j = 0; j < nums.length - i; j++) {
if (nums[j] < nums[j -1]) {
swap(nums, j - 1 , j)
}

}
}
};```
You can’t perform that action at this time.