LeetCode高频100题刷题记录之——三数之和

LeetCode高频100题刷题记录之——三数之和

双指针法求解

思路：首先对列表中的数字进行排序，遍历所有数字，每次遍历的左右两端各定义一个指针，根据加法的结果判定是左指针移动还是右指针移动，这个过程要剔除重复数据。

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        l = len(nums)
        result = []

        if l >= 3:
            nums = self.bubblesort(nums)
            for s1 in range(l):
                if s1 > 0 and nums[s1] == nums[s1-1]:
                    continue
                s3 = l - 1
                
                for s2 in range(s1+1, l):
                    if s2 > s1+1 and nums[s2] == nums[s2-1]:
                        continue
                    v = nums[s1] + nums[s2] + nums[s3]

                    while s2 < s3 and v > 0:
                        s3 -= 1
                        v = nums[s1] + nums[s2] + nums[s3]
                    if s2 == s3:
                        break
                    if v == 0:
                        result.append([nums[s1], nums[s2], nums[s3]])
        return result

    def bubblesort(self, nums: List[int]) -> List[int]:
        if len(nums) == 0:
            return nums
        else:
            i = len(nums)
            while i > 0:
                for k in range(i-1):
                    if nums[k] > nums[k+1]:
                        a = nums[k+1]
                        nums[k+1] = nums[k]
                        nums[k]   = a
                i -= 1
        return nums