LeetCode每日一题(2364. Count Number of Bad Pairs)

You are given a 0-indexed integer array nums. A pair of indices (i, j) is a bad pair if i < j and j - i != nums[j] - nums[i].

Return the total number of bad pairs in nums.

Example 1:

Input: nums = [4,1,3,3]
Output: 5

Explanation:
The pair (0, 1) is a bad pair since 1 - 0 != 1 - 4.
The pair (0, 2) is a bad pair since 2 - 0 != 3 - 4, 2 != -1.
The pair (0, 3) is a bad pair since 3 - 0 != 3 - 4, 3 != -1.
The pair (1, 2) is a bad pair since 2 - 1 != 3 - 1, 1 != 2.
The pair (2, 3) is a bad pair since 3 - 2 != 3 - 3, 1 != 0.
There are a total of 5 bad pairs, so we return 5.

Example 2:

Input: nums = [1,2,3,4,5]
Output: 0

Explanation: There are no bad pairs.

Constraints:

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

---

1. bad_pairs = total_pairs - not_bad_pairs
2. j - i != nums[j] - nums[i] => nums[i] - i != nums[j] - j

以上两条是解这题的核心, 假设 diff[i] = nums[i] - i, 那如果 diff[i] == diff[j]则 nums[i]和 nums[j]一定可以组成not bad pair, 所以任何两个有相同的 diff 的 nums 相互之间一定是可以组成not<