LeetCode 805. Split Array With Same Average

In a given integer array A, we must move every element of A to either list B or list C. (B and C initially start empty.)

Return true if and only if after such a move, it is possible that the average value of B is equal to the average value of C, and B and C are both non-empty.

Example :
Input: 
[1,2,3,4,5,6,7,8]
Output: true
Explanation: We can split the array into [1,4,5,8] and [2,3,6,7], and both of them have the average of 4.5.

Note:

The length of A will be in the range [1, 30].
A[i] will be in the range of [0, 10000].

思路：DP: 实质上就是加了hashmap来存放重复计算的结果的recursion（brute-force）写法. 下面的代码里，一个答案是由三个东西决定的：i, sum, n，因此hashmap里的key是这三个，value是boolean = false，因此直接用一个set代替了。

    public boolean splitArraySameAverage(int[] A) {
        Arrays.sort(A);
        if (A.length == 0) return true;
        int sum = 0;
        for (int i = 0; i < A.length; i++) {
            sum += A[i];
        }
        return helper(A, 0, 0, 0, sum, new HashMap<>());
    }
    public boolean helper(int[] A, int i, int sum, int n, int S, Map<Integer, Map<Integer, Set<Integer>>> map) {
        //System.out.println(i+" "+sum+" "+n);
        if(map.containsKey(i) && map.get(i).containsKey(sum) && map.get(i).get(sum).contains(n))return false;
        // if(map.contains(list)) return false;
        boolean r = false;
        if (n != A.length && n != 0 && S * n == sum * A.length) {
            return true;
        }
        else if (i == A.length || S * n < sum * A.length) {
            r = false;
        }
        else r = helper(A, i+1, sum, n, S, map) || helper(A, i+1, sum + A[i], n + 1, S, map);
        if(!map.containsKey(i))map.put(i, new HashMap<>());
        if(!map.get(i).containsKey(sum))map.get(i).put(sum, new HashSet<>()); 
        map.get(i).get(sum).add(n);
        return r;
    }