1512. Number of Good Pairs

标签：example   input   +=   led   number   solution   return   The   code   

Given an array of integers nums.

A pair (i,j) is called good if nums[i] == nums[j] and i < j.

Return the number of good pairs.

Example 1:

Input: nums = [1,2,3,1,1,3]
Output: 4
Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 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

class Solution {
    public int numIdenticalPairs(int[] nums) {
        int res = 0;
        for(int i = 0; i < nums.length-1; i++){
            for(int j = i+1; j < nums.length; j++){
                res += nums[i]==nums[j] ? 1:0;
            }
        }
        return res;
    }
}

1512. Number of Good Pairs

标签：example   input   +=   led   number   solution   return   The   code   

原文地址：https://www.cnblogs.com/wentiliangkaihua/p/13291329.html