刷题 | leetcode 75 颜色分类

解题思路：

最简单的方法就是实现一个冒泡排序，但是这个开销明显比较大，因为题目给了很多限制条件，比如说只有0,1,2，肯定是想考察更高效的思路，比如说使用指针，根据题解，可以采用单指针，两次遍历，第一次把0都移到头部，第二次把2都移到尾部。或者使用双指针单次遍历。

冒泡：

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

单指针,时间和内存开销并没小多少：

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

双指针，效率提升了：

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

                p0 = p0 + 1
                p1 = p1 + 1