Leetcode 75. Sort Colors

最新推荐文章于 2024-10-14 14:59:46 发布

小白菜又菜

最新推荐文章于 2024-10-14 14:59:46 发布

阅读量174

点赞数

分类专栏：解题报告

本文链接：https://blog.youkuaiyun.com/mobius_strip/article/details/109380934

版权

解题报告专栏收录该内容

1396 篇文章

订阅专栏

Problem

Sort a list, which only contain 0, 1 ,2.

Algorithm

Count each number size and print items follow 0, 1, 2 with each size.

Code

class Solution:
    def sortColors(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        t = len(nums)
        cnt = [0, 0, 0]
        for i in range(t):
            cnt[nums[i]] += 1
        
        for i in range(cnt[0]):
            nums[i] = 0
        for i in range(cnt[0], cnt[0]+cnt[1]):
            nums[i] = 1
        for i in range(cnt[0]+cnt[1], t):
            nums[i] = 2
        
        return nums