array (1) 썸네일형 리스트형 16. 3Sum Closest leetcode.com/problems/3sum-closest/ 3Sum Closest - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution: def threeSumClosest(self, nums: List[int], target: int) -> int: diff = float('inf') n = len(nums) nums.sort() for i in range(n-2) : l, r = i+1, n-1 while l < r : curr .. 이전 1 다음