（Python-三数之和）个人学习记录 2024/1/15

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        n = len(nums)
        if (not nums or n < 3):
            return []
        nums.sort()
        # print(nums)
        res = []
        for i in range(n):
            if nums[i] > 0:
                return res
            if(i>0 and nums[i]==nums[i-1]):
                continue
            L = i+1
            R = n-1
            while(L<R):
                if(nums[i] + nums[L] + nums[R] == 0):
                    res.append([nums[i], nums[L], nums[R]])
                    while(L<R and nums[L] == nums[L+1]):
                        L=L+1
                    while(L<R and nums[R] == nums[R-1]):
                        R=R-1
                    L=L+1
                    R=R-1
                elif(nums[i] + nums[L] + nums[R] > 0):
                    R=R-1
                else:
                    L=L+1
        return res

重点:

1.首先对数组进行排序，快捷函数为

list.sort()

2.双向指针，且重点在于排除重复解。