Leetcode-Py/3Sum.py at master · SocialfiPanda/Leetcode-Py · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution:
    def threeSum(self, A):
        A, result, i = sorted(A), [], 0
        while i < len(A) - 2:
            j, k = i + 1, len(A) - 1
            while j < k:
                if A[i] + A[j] + A[k] < 0:
                    j += 1
                elif A[i] + A[j] + A[k] > 0:
                    k -= 1
                else:
                    result.append([A[i], A[j], A[k]])
                    j, k = j + 1, k - 1
                    while j < k and A[j] == A[j - 1]:
                        j += 1
                    while j < k and A[k] == A[k + 1]:
                        k -= 1
            i += 1
            while i < len(A) - 2 and A[i] == A[i - 1]:
                i += 1
        return result