454. 4Sum II(Java)
来源:互联网 发布:windows模拟器安卓版 编辑:程序博客网 时间:2024/05/23 01:59
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:2Explanation:The two tuples are:1. (0, 0, 0, 1) -> A[0] + B[0] + C[0] + D[1] = 1 + (-2) + (-1) + 2 = 02. (1, 1, 0, 0) -> A[1] + B[1] + C[0] + D[0] = 2 + (-1) + (-1) + 0 = 0
public class Solution { public int fourSumCount(int[] A, int[] B, int[] C, int[] D) { Map<Integer, Integer> map = new HashMap<>(); for (int i = 0 ; i < A.length; i ++) { for (int j = 0; j < B.length; j ++) { int sum = A[i] + B[j]; map.put(sum, map.getOrDefault(sum, 0) + 1); // key是唯一的,如果key出现过,会覆盖之前的值 } } int res = 0; for (int i = 0; i < C.length; i ++) { for (int j = 0; j < D.length; j ++) { res += map.getOrDefault(- C[i] - D[j], 0); } } return res; }}
阅读全文
0 0
- 454. 4Sum II(Java)
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- 454. 4Sum II
- android studio gradle 离线包 gradle-x.x-all.zip 离线配置
- java操作hbase常用方法总结
- 带指针成员类、析构函数出错、复制/赋值构造函数的注意事项
- jQuery之属性操作、class快捷操作和标签包含内容操作
- nyoj55 懒省事的小明
- 454. 4Sum II(Java)
- Win10系统以管理员身份运行运行框的方法
- linux中的进程查看与管理
- DevOps2-在Jenkins容器中访问Gitlab容器需要特别注意的地方
- 上传项目到github
- 杭电acm—1376 Octal Fractions
- XYNUOJ 问题 E: 魔法扫帚
- Android知识体系梳理笔记一:Android跨进程通信:AIDL
- 消息队列