4Sum II (M)
題目
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
題意
給定四個陣列，在各個陣列中取出一個數使其和為0，求這樣的數對的個數，
思路
用HashMap記錄其中兩個陣列的組合情況，再遍歷另外兩個陣列的組合進行處理，
代碼實作
Java
class Solution {
public int fourSumCount(int[] A, int[] B, int[] C, int[] D) {
int count = 0;
Map<Integer, Integer> hash = new HashMap<>();
for (int i = 0; i < A.length; i++) {
for (int j = 0; j < B.length; j++) {
int sum = A[i] + B[j];
hash.put(sum, hash.getOrDefault(sum, 0) + 1);
}
}
for (int i = 0; i < C.length; i++) {
for (int j = 0; j < D.length; j++) {
int target = - C[i] - D[j];
if (hash.containsKey(target)) {
count += hash.get(target);
}
}
}
return count;
}
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/236430.html
標籤：其他
上一篇：資料結構之——樹
下一篇：洗掉鏈表中重復的結點