class Solution(object):
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        result, diff=0,sys.maxint
        nums.sort()
        
        for i in xrange(0,len(nums)-2):
            if i>0 and nums[i]==nums[i-1]:
                continue
            left, right=i+1,len(nums)-1
            while left<right:
                total=nums[i]+nums[left]+nums[right]
                temp_diff=abs(target-total)
                if temp_diff<diff:
                    result=total
                    diff=temp_diff
                if total<target:
                    left+=1
                else :
                    right-=1
        return result