This is the multi-page printable view of this section. Click here to print.

Return to the regular view of this page.

0450-0499

Solutions to LeetCode Problems 0450-0499.

1 - 0454.四数相加 II

方法一:分组 + 哈希表

时间复杂度 O(n2)O(n^2),空间复杂度 O(n2)O(n^2)

func fourSumCount(nums1 []int, nums2 []int, nums3 []int, nums4 []int) int { ans, count12 := 0, make(map[int]int) for _, v1 := range nums1 { for _, v2 := range nums2 { count12[v1+v2]++ } } for _, v3 := range nums3 { for _, v4 := range nums4 { ans += count12[-(v3 + v4)] } } return ans }