[LeetCode] 15. 3Sum

문제

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

3Sum - LeetCode

 

코드

class Solution(object):
    def threeSum(self, nums):
        result = []
        n = len(nums)
        
        nums.sort()
        
        for i in range(n-2):
            if i != 0 and nums[i-1] == nums[i]:
                continue
            j = i + 1
            k = n - 1
            while j < k:
                if nums[j] + nums[k] == -nums[i]:
                    result.append([nums[i], nums[j], nums[k]])
                    j += 1
                    k -= 1
                    while j < k and nums[j-1] == nums[j]:
                        j += 1
                    while j < k and nums[k] == nums[k+1]:
                        k -= 1
                elif nums[j] + nums[k] < -nums[i]:
                    j += 1
                else:
                    k -= 1
                    
        return result