mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 01:15:57 +08:00
67 lines
1.1 KiB
Markdown
67 lines
1.1 KiB
Markdown
# [1512. Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/)
|
||
|
||
## 题目
|
||
|
||
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
|
||
|
||
```
|
||
|
||
**Constraints**:
|
||
|
||
- `1 <= nums.length <= 1000`
|
||
- `1 <= nums[i] <= 100`
|
||
|
||
## 题目大意
|
||
|
||
给你一个整数数组 nums。如果一组数字 (i,j) 满足 nums[i] == nums[j] 且 i < j ，就可以认为这是一组好数对。返回好数对的数目。
|
||
|
||
## 解题思路
|
||
|
||
- 简单题，按照题目中好数对的定义，循环遍历判断两数是否相等，累加计数即可。
|
||
|
||
## 代码
|
||
|
||
```go
|
||
package leetcode
|
||
|
||
func numIdenticalPairs(nums []int) int {
|
||
total := 0
|
||
for x := 0; x < len(nums); x++ {
|
||
for y := x + 1; y < len(nums); y++ {
|
||
if nums[x] == nums[y] {
|
||
total++
|
||
}
|
||
}
|
||
}
|
||
return total
|
||
}
|
||
|
||
``` |