LeetCode#18四数之和 Python解

至此已经做了两数之和、三数之和和四数之和了，思路已经清楚，就老是细节上出错，粗心！
我一直觉得自己是个细心的人，怎么回事儿呢！

class Solution:
    def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
        n = len(nums)
        if not nums or n<4:return []
        #if (n == 4 and sum(nums) == target):return [nums]
        nums.sort()

        res = []
        for i in range(n-3):
            if (nums[0] + nums[1] + nums[2] + nums[3] > target):break
            if (nums[i] + nums[-1] + nums[-2] + nums[-3] < target):
                continue
            if (i > 0 and nums[i] == nums[i-1]):
                continue
            for j in range(i+1,n-2):

                if (nums[i] + nums[j] + nums[j+1] + nums[j+2] > target):break
                if (nums[i] + nums[j] + nums[-1] + nums[-2] < target):
                    continue
                if (j-i>1 and nums[j] == nums[j-1]):
                    continue
                
                l,r = j+1, n-1
                while l < r:
                    if (nums[i] + nums[j] + nums[l] + nums[r] == target):
                        res.append([nums[i],nums[j],nums[l],nums[r]])
                        while(l<r and nums[l] == nums[l+1]):
                            l += 1
                        while(l<r and nums[r] == nums[r-1]):
                            r -= 1
                        l += 1
                        r -= 1
                    elif (nums[i] + nums[j] + nums[l] + nums[r] - target > 0):
                            r -= 1
                    else:
                        l += 1
        return res

此外，有用哈希的，有用深度优先搜索来一次性解决n数之和的，可是我看着dfs好复杂呀，静不下心来看…