leetcode454~4Sum II

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.

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

思路：可以用 map集合存储其中两个数组的sum，然后题目退化成2sum问题了。。下面有使用jdk8的新特性~

public class FourSumII {
    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++) {
//              if(!map.containsKey(A[i]+B[j])) {
//                  map.put(A[i]+B[j], 1);
//              } else {
//                  map.put(A[i]+B[j], map.get(A[i]+B[j])+1);
//              }
                //上面注释的语句可以简化成下面这个，jdk1.8新特性
                map.put(A[i]+B[j], map.getOrDefault(A[i]+B[j], 0)+1);
            }
        }
       int res = 0;
       for(int i=0;i<C.length;i++) {
           for(int j=0;j<D.length;j++) {
//             if(map.containsKey(-(C[i]+D[j]))) {
//                 res += map.get(-(C[i]+D[j]));
//             }
               res += map.getOrDefault(-(C[i]+D[j]), 0);
           }
       }
       return res;
    }
}