75. Sort Colors

Sterben_Da

于 2021-04-15 12:30:39 发布

阅读量110

点赞数

分类专栏： leetcode-python 文章标签：算法 leetcode python

本文链接：https://blog.csdn.net/Sterben_Da/article/details/115720845

版权

leetcode-python 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

75. Sort Colors

Medium

5164296Add to ListShare

Given an array nums 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.

We will use the integers 0, 1, and 2 to represent the color red, white, and blue, respectively.

Example 1:

Input: nums = [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]

Example 2:

Input: nums = [2,0,1]
Output: [0,1,2]

Example 3:

Input: nums = [0]
Output: [0]

Example 4:

Input: nums = [1]
Output: [1]

Constraints:

n == nums.length
1 <= n <= 300
nums[i] is 0, 1, or 2.

Follow up:

Could you solve this problem without using the library's sort function?
Could you come up with a one-pass algorithm using only O(1) constant space?

class Solution:
    def sortColors(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        解题思路：要求空间O(1),考虑用直接插入排序，对于当前元素插入到前面有序的前i个元素里
        时间复杂度最好O(n)，最坏O(n^2)
        """
        for i in range(1, len(nums)):
            j = i
            while j > 0 and nums[j] < nums[j - 1]:
                tmp = nums[j - 1]
                nums[j - 1] = nums[j]
                nums[j] = tmp
                j -= 1
        # print(nums)