标签：c style class blog code java
原题地址：https://oj.leetcode.com/problems/sort-colors/
题意：
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.
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: # @param A a list of integers # @return nothing, sort in place # @should learn another algorithm def sortColors(self, A): if A == []: return p0 = 0; p2 = len(A) - 1; i = 0 while i <= p2: if A[i] == 2: A[i], A[p2] = A[p2], A[i] p2 -= 1 elif A[i] == 0: A[i], A[p0] = A[p0], A[i] p0 += 1 i += 1 else: i += 1
[leetcode]Sort Colors @ Python,布布扣,bubuko.com
[leetcode]Sort Colors @ Python
标签：c style class blog code java
原文地址：http://www.cnblogs.com/zuoyuan/p/3775832.html
