Leetcode 15. 3Sum

https://leetcode.com/problems/3sum/

Medium

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

The solution set must not contain duplicate triplets.

Example:

Given array nums = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
  [-1, 0, 1],
  [-1, -1, 2]
]

---

• 先升序排序，然后遍历第一个元素，在其后面元素中，再用两个指针，一个从前往后，一个从后往前遍历。
• typing — Support for type hints — Python 3.7.4rc1 documentation
  • https://docs.python.org/3/library/typing.html?highlight=typing#module-typing
  • from typing import List

 1 class Solution:
 2     def threeSum(self, nums: List[int]) -> List[List[int]]:
 3         res = []
 4         nums.sort()
 5         
 6         for i in range(len(nums) - 2):
 7             if i == 0 or nums[i] != nums[i - 1]:
 8                 left, right = i + 1, len(nums) - 1
 9                 
10                 while left < right:
11                     sum = nums[i] + nums[left] + nums[right]
12                 
13                     if sum < 0:
14                         left += 1
15                     elif sum > 0:
16                         right -= 1
17                     else:
18                         # should be List of List
19                         res.append( [ nums[i], nums[left], nums[right] ] )
20                         
21                         while left < right and nums[left] == nums[left + 1]:
22                             left += 1
23                             
24                         while left < right and nums[right] == nums[right - 1]:
25                             right -= 1
26                             
27                         # remember to move pointers
28                         left += 1
29                         right -= 1
30         
31         return res

View Code

 

 

转载于:https://www.cnblogs.com/pegasus923/p/11122726.html