mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-25 20:21:47 +08:00
规范格式
This commit is contained in:
@ -0,0 +1,22 @@
|
||||
package leetcode
|
||||
|
||||
func findPairs(nums []int, k int) int {
|
||||
if k < 0 || len(nums) == 0 {
|
||||
return 0
|
||||
}
|
||||
var count int
|
||||
m := make(map[int]int, len(nums))
|
||||
for _, value := range nums {
|
||||
m[value]++
|
||||
}
|
||||
for key := range m {
|
||||
if k == 0 && m[key] > 1 {
|
||||
count++
|
||||
continue
|
||||
}
|
||||
if k > 0 && m[key+k] > 0 {
|
||||
count++
|
||||
}
|
||||
}
|
||||
return count
|
||||
}
|
Reference in New Issue
Block a user