Leetcode 1512 Number of Good Pairs Solution in Java | Hindi Coding Community

 

Given an integers array nums, return the number of good pairs. 

A pair (i, j) is called good if nums[i] == nums[j] and i < j. That is for same value if the indices are different then it is said to be  a good pair. Write a program to find the total number of good pairs in an integer array.

 

Example 1:

Input: nums = [1,2,3,1,1]
Output: 3
Explanation: There are 3 good pairs (0,3), (0,4), (3,4)  0-indexed.

Example 2:

Input: nums = [1,1,1,1]
Output: 6
Explanation: Each pair in the array are good.

Example 3:

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

 

Constraints:

• 1 <= nums.length <= 100
• 1 <= nums[i] <= 100

Java Code :

class Solution {

public int numIdenticalPairs(int[] nums) {

int count=0;

for(int i=0;i<nums.length-1;i++)

{

for(int j=i+1;j<nums.length;j++){

if(nums[i]==nums[j])

{count++;}

}

}

return count;

}

}