【leetcode每日刷题】454. 4Sum II

最新推荐文章于 2024-08-18 21:58:09 发布

liff_lee

最新推荐文章于 2024-08-18 21:58:09 发布

阅读量116

点赞数

分类专栏： golang leetcode刷题

本文链接：https://blog.csdn.net/m0_38103546/article/details/95871595

版权

leetcode刷题同时被 2 个专栏收录

171 篇文章 0 订阅

订阅专栏

golang

16 篇文章 2 订阅

订阅专栏

Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.

To make problem a bit easier, all A, B, C, D have same length of N where 0 ≤ N ≤ 500. All integers are in the range of -228 to 228 - 1 and the result is guaranteed to be at most 231 - 1.

Example:

Input:
A = [ 1, 2]
B = [-2,-1]
C = [-1, 2]
D = [ 0, 2]

Output:
2

Explanation:
The two tuples are:
1. (0, 0, 0, 1) -> A[0] + B[0] + C[0] + D[1] = 1 + (-2) + (-1) + 2 = 0
2. (1, 1, 0, 0) -> A[1] + B[1] + C[0] + D[0] = 2 + (-1) + (-1) + 0 = 0

package main
import(
	"fmt"
)

func fourSumCount(A []int, B []int, C []int, D []int) int {
	length := len(A)
	dict := make(map[int]int)
	for i:=0; i<length; i++ {
		for j:=0; j<length; j++{
			if v, ok := dict[A[i]+B[j]]; ok{
				dict[A[i]+B[j]] = v + 1
			}else{
				dict[A[i]+B[j]] = 1
			}
		}
	}
	result := 0
	for i:=0; i<length; i++ {
		for j:=0; j<length; j++{
			if v, ok := dict[-C[i]-D[j]]; ok{
				result += v
			}
		}
	} 
	return result
}

func main(){
	A := []int{1, 2}
	B := []int{-2,-1}
	C := []int{-1, 2}
	D := []int{0, 2}
	result := fourSumCount(A, B, C, D)
	fmt.Println(result)
}

先将A和B所有元素相加的情况存在map中，值和次数的形式

然后遍历C和D中所有可能的元素组合情况的和然后只要0-值在map中，则获取map中的值和最后的结果相加。