leetcode 解题记录 --- 荷兰旗问题

class Solution:
    def sortColors(self, nums) :
        """
        Do not return anything, modify nums in-place instead.
        """
        n = len(nums)
        l, r = -1, n
        i = 0

        while i<r:
            if nums[i]<1:
                l+=1
                self.swap(nums,i,l)
                i+=1
            elif 1<nums[i]:
                r-=1
                self.swap(nums,i,r)
            else:
                i+=1
        return nums


    def swap(self,nums,i,j):
        tem = nums[i]
        nums[i] = nums[j]
        nums[j] = tem