Count Nice Pairs in an Array

You are given an array nums that consists of non-negative integers. Let us define rev(x) as the reverse of the non-negative integer x. For example, rev(123) = 321, and rev(120) = 21. A pair of indices (i, j) is nice if it satisfies all of the following conditions:

• 0 <= i < j < nums.length
• nums[i] + rev(nums[j]) == nums[j] + rev(nums[i])

Return the number of nice pairs of indices. Since that number can be too large, return it modulo 109 + 7.

Example 1:

Input: nums = [42,11,1,97]
Output: 2
Explanation: The two pairs are:
 - (0,3) : 42 + rev(97) = 42 + 79 = 121, 97 + rev(42) = 97 + 24 = 121.
 - (1,2) : 11 + rev(1) = 11 + 1 = 12, 1 + rev(11) = 1 + 11 = 12.

Example 2:

Input: nums = [13,10,35,24,76]
Output: 4

Constraints:

• 1 <= nums.length <= 105
• 0 <= nums[i] <= 109

思路：把数学公式

// nums[i] + rev(nums[j]) == nums[j] + rev(nums[i])
// nums[i] - rev(nums[i]) == nums[j] - rev(nums[j]); 

Cn2 = n * (n - 1) / 2; = 1 + 2 + 3 .. + n - 1, 那么每次我加上上一次的hashmap count即可；

class Solution {
    // nums[i] + rev(nums[j]) == nums[j] + rev(nums[i])
    // nums[i] - rev(nums[i]) == nums[j] - rev(nums[j]);
    public int countNicePairs(int[] nums) {
        int MOD = 1000000007;
        HashMap<Integer, Integer> hashmap = new HashMap<>();
        int count = 0;
        for(int i = 0; i < nums.length; i++) {
            int value = nums[i] - reverse(nums[i]);
            if(hashmap.containsKey(value)) {
                count = count % MOD + hashmap.get(value) % MOD;
                hashmap.put(value, hashmap.get(value) + 1);
            } else {
                hashmap.put(value, 1);
            }
        }
        return count % MOD;
    }
    
    public int reverse(int num) {
        int res = 0;
        while(num != 0) {
            res = res * 10 + num % 10;
            num = num / 10;
        }
        return res;
    }
}