Package g2301_2400.s2364_count_number_of_bad_pairs

Class Solution

java.lang.Object

g2301_2400.s2364_count_number_of_bad_pairs.Solution

public class Solution
extends Object

2364 - Count Number of Bad Pairs.<p>Medium</p> <p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>. A pair of indices <code>(i, j)</code> is a <strong>bad pair</strong> if <code>i < j</code> and <code>j - i != nums[j] - nums[i]</code>.</p> <p>Return <em>the total number of <strong>bad pairs</strong> in</em> <code>nums</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [4,1,3,3]</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong></p> <p>The pair (0, 1) is a bad pair since 1 - 0 != 1 - 4.</p> <p>The pair (0, 2) is a bad pair since 2 - 0 != 3 - 4, 2 != -1.</p> <p>The pair (0, 3) is a bad pair since 3 - 0 != 3 - 4, 3 != -1.</p> <p>The pair (1, 2) is a bad pair since 2 - 1 != 3 - 1, 1 != 2.</p> <p>The pair (2, 3) is a bad pair since 3 - 2 != 3 - 3, 1 != 0.</p> <p>There are a total of 5 bad pairs, so we return 5.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,4,5]</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> There are no bad pairs.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>1 <= nums[i] <= 10⁹</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
long	countBadPairs(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

countBadPairs

public long countBadPairs(int[] nums)