Question: http://oj.leetcode.com/problems/3sum-closest/

Question Name: 3Sum Closest

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 | class Solution: # @return an integer def threeSumClosest(self, num, target): result = 0xFFFFFFFF # Initially set a impossible large number resultDif = 0xFFFFFFFF # Initially set a impossible large number num.sort() i = 0 # For the first item while i < len(num) - 2: j = i + 1 # For the middle item k = len(num) - 1 # For the last item while j < k: temp = num[i]+ num[j]+num[k] if temp == target: # Not possible to be closer return temp elif temp< target: if target - temp < resultDif: # Find a closer combination resultDif = target -temp result = temp # Skip duplicate num[j-1] j += 1 while j < k+1 and num[j] == num[j-1]: j += 1 else: if temp - target < resultDif: # Find a closer combination resultDif = temp - target result = temp # Skip duplicate num[k+1] k -= 1 while k > j-1 and num[k] == num[k+1]: k -= 1 # Skip duplicate num[i-1] i += 1 while i < len(num)-1 and num[i] == num[i-1]: i += 1 return result |