• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2301_2400.s2364_count_number_of_bad_pairs.readme.md Maven / Gradle / Ivy

2364\. Count Number of Bad Pairs

Medium

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