這個改了好久，發篇部落格紀念一下好了。

程式碼是用python寫的。

有不對的可以改進的地方，歡迎指正。

class Solution(object):
    def fourSum(self, nums, target):
        result=[]
        l = len(nums)
        #排序
        for m in range(l-1):
            for p in range(m+1,l):
                if nums[m]>nums[p]:
                    n =
 
 nums[m]
                    nums[m] = nums[p]
                    nums[p] = n
        for i in range(l-3):
            for j in range(i+1,l-2):
                left = j+1
                right = l-1           
                while(right>left):
                    sums = nums[i]+nums[j]+nums[left]
 
+nums[right]
                    if sums>target:
                        right = right-1
                    elif sums<target:
                        left = left+1
                    elif sums == target:
                        result_list = [nums[i],nums[j],nums[left],nums[right]]
                        if
 
 result_list not in result:
                            result.append(result_list) 
                        left = left+1
                        right = right-1
        return result