leetcode 【 Sort Colors 】python 实现

题目：

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.

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?

代码：oj测试通过 Runtime: 47 ms

 1 class Solution:
 2     # @param A a list of integers
 3     # @return nothing, sort in place
 4     def sortColors(self, A):
 5         # None case
 6         if A is None:
 7             return None
 8         # two pointers: p0 for red and p2 for blue
 9         p0 = 0
10         p2 = len(A)-1
11         i = 0
12         while i <= p2 :
13             if A[i] == 0 :
14                 A[i],A[p0] = A[p0],A[i]
15                 i += 1
16                 p0 += 1
17             elif A[i] == 1 :
18                 i += 1
19             else :
20                 A[i],A[p2] = A[p2],A[i]
21                 p2 -= 1

思路：

这道题的要求跟很多数组题的要求类似，如何遍历一遍数组就完成任务。

就是头尾各放两个指针。

因为有三种类型的元素，所以需要守住头尾两个指针就可以了。

很多数组题目都是利用交换元素值的技巧，遍历一次就可以了。

转载于:https://www.cnblogs.com/xbf9xbf/p/4246295.html

leetcode 【 Sort Colors 】python 实现相关推荐

[leetcode]Sort Colors
问题描写叙述: Given an array with n objects colored red, white or blue, sort them so that objects of the s ...
LeetCode Sort Colors
1.题目 Given an array with n objects colored red, white or blue, sort them so that objects of the same ...
LeetCode 75. Sort Colors （python一次遍历，模拟三路快排）
LeetCode 75. Sort Colors (python一次遍历,模拟三路快排) 题目分析: 本题需要实现数字只包含0,1,2的排序,并且要求一次遍历. 由于只用把数字隔离开,很容易想到快排的 ...
【排序】LeetCode 75. Sort Colors
LeetCode 75. Sort Colors Solution1: 参考自:<leetcode-cpp 答案> 由于0,1,2非常紧凑,首先想到计数排序(counting sort), ...
Leetcode 075 Sort Colors
题目连接:Leetcode 075 Sort Colors 解题思路:从左向右遍历,同时维护两个指针r和b,0~r位置上的元素为0,b~n-1位置上的为2.在遍历过程中,碰到0,放到r的位置:碰到2, ...
[LeetCode]75.Sort Colors
[题目连接] 75.Sort Colors [题目] Given an array with n objects colored red, white or blue, sort them so th ...
Sort Colors - LeetCode
Sort Colors - LeetCode 题目: Given an array with n objects colored red, white or blue, sort them so th ...
75. Sort Colors - LeetCode
Question 75. Sort Colors Solution 题目大意: 给一个数组排序,这个数组只有0,1,2三个元素,要求只遍历一遍思路: 记两个索引,lowIdx初始值为0,highId ...
LeetCode刷题Python实录
使用Python的LeetCode刷题前言题目 1408. 数组中的字符串匹配 508. 出现次数最多的子树元素和 1089. 复写零剑指 Offer 14- I. 剪绳子 1175. 质数排列 ...
82 颜色分类II-彩虹排序（Sort Colors II）
文章目录 1 题目 2 解决方案 2.1 思路 2.2 图解 2.3 时间复杂度 2.4 空间复杂度 3 源码 1 题目题目:颜色分类II(Sort Colors II) 描述:给定一个有n个对象( ...

leetcode 【 Sort Colors 】python 实现

leetcode 【 Sort Colors 】python 实现相关推荐

最新文章

热门文章