59. 最接近的三数之和

class Solution:
    """
    @param numbers: Give an array numbers of n integer
    @param target: An integer
    @return: return the sum of the three integers, the sum closest target.
    """
    def threeSumClosest(self, numbers, target):
        # write your code here
        res = []
        d = []
        numbers.sort()
        for i in range(len(numbers)):
            if i == 0:
                d.append([numbers[i]])
            else:
                for j in range(len(d)):
                    a = d[j] + [numbers[i]]
                    d.append(d[j] + [numbers[i]])

                    if a not in res and len(a) == 3:
                        res.append(a)
                d.append([numbers[i]])

                
        
        p = 2**32
        r = 0
        for z in res:
            if abs(sum(z) - target) < p:
                p = abs(sum(z) - target)
                r = sum(z)
        return r