NYUer | LeetCode15 3Sum

最新推荐文章于 2024-07-16 23:15:32 发布

Moses_SU

最新推荐文章于 2024-07-16 23:15:32 发布

阅读量86

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法职场和发展数据结构 python

本文链接：https://blog.csdn.net/Moses_SU/article/details/127626690

版权

LeetCode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

LeetCode15 3Sum

Author: Stefan Su
Create time: 2022-10-31 19:46:29
Location: New York City, NY, USA

Description `Medium`

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.

Notice that the solution set must not contain duplicate triplets.

Example 1

Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
Explanation: 
nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0.
nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0.
nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0.
The distinct triplets are [-1,0,1] and [-1,-1,2].
Notice that the order of the output and the order of the triplets does not matter.

Example 2

Input: nums = [0,1,1]
Output: []
Explanation: The only possible triplet does not sum up to 0.

Example 3

Input: nums = [0,0,0]
Output: [[0,0,0]]
Explanation: The only possible triplet sums up to 0.

Constrains

3 <= nums.length <= 3000
-10⁵ <= nums[i] <= 10⁵

Analysis

Two pointers version in this problem is better than hash version. For details, see comments in code.

Solution

class Solution(object):
    def threeSum(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """

        # two pointer version

        result = []

        nums = sorted(nums)
        # go through first number of three numbers
        for i in range(len(nums)):
            # if this number larger than 0, break the for loop, since nums[left] and nums[right] must larger than 0
            if nums[i] > 0:
                break
            # KEY OPERATION: remove duplication operation for i
            # For example: nums = [-1, -1, -1, 2]
            # we get nums[0] + nums[2] + nums[3] = 0, but also nums[1] + nums[2] + nums[3] = 0
            # but the same value in result [-1, -1, 2]
            # therefore, we should compare current i with previous one
            if nums[i] == nums[i-1] and i > 0:
                continue

            # initialize left and right
            left = i + 1
            right = len(nums) - 1
            while right > left:
                # print('i = ', i)
                # print(nums[i], nums[left], nums[right])
                # if nums[i] + nums[left] + nums[right] > 0, then move right index to a previous index
                if nums[i] + nums[left] + nums[right] > 0:
                    right -= 1
                # if nums[i] + nums[left] + nums[right] < 0, then move left index to a latter index
                elif nums[i] + nums[left] + nums[right] < 0:
                    left += 1
                else:
                    # append current valid list into result
                    result.append([nums[i], nums[left], nums[right]])
                    # KEY OPERATION: remove duplication operation for right
                    # if nums[right] == nums[right - 1], then move right to a previous index
                    # For example, nums = [-1, -1, -1, 0, 0, 0, 1, 1, 1]
                    # current is nums[0] + nums[3] + nums[8] = 0
                    # but if we replace nums[8] with nums[7] or nums[6], it works as well
                    # therefore, we should move right index to remove this duplicated output
                    # although, the index of value 1 can be different (6, 7, 8)
                    while right > left and nums[right] == nums[right - 1]:
                        right -= 1
                    # KEY OPERATION: remove duplication operation for left
                    # if nums[left] == nums[left + 1], then move left to a latter index
                    # same explanation as movement of right index
                    while right > left and nums[left] == nums[left + 1]:
                        left += 1
                    left += 1
                    right -= 1

            # print('result = ', result)

        return result