leetcode 923. 3Sum With Multiplicity

When dealing with combination number problems, I think easy-to-write code is better than fast code.....

class Solution {
    public int threeSumMulti(int[] A, int target) {
        Map<Integer, Integer> m = new HashMap<Integer, Integer>();
        int P = 1000000007;
        int ret = 0;
        for (int i = 0; i < A.length; ++i) {
            int v1 = A[i];
            for (int j = i + 1; j < A.length; ++j) {
                int v2 = A[j];
                int c = m.getOrDefault(target - v1 - v2, 0);
                if (c == 0) continue;
                ret = (ret + c) % P;
            }
            m.put(v1, m.getOrDefault(v1, 0) + 1);
        }
        return ret;
    }
}

转载于:https://www.cnblogs.com/exhausttolive/p/10657395.html