We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
给你一个整数数组 nums 和一个整数 k ,请你返回数对 (i, j) 的数目,满足 i < j 且 |nums[i] - nums[j]| == k 。
nums
k
(i, j)
i < j
|nums[i] - nums[j]| == k
|x|的值定义为:
|x|
如果 x >= 0 ,那么值为 x 。 如果 x < 0 ,那么值为 -x 。
x >= 0
x
x < 0
-x
输入:nums = [1,2,2,1], k = 1 输出:4 解释:差的绝对值为 1 的数对为: - [(1),(2),2,1] - [(1),2,(2),1] - [1,(2),2,(1)] - [1,2,(2),(1)]
输入:nums = [1,3], k = 3 输出:0 解释:没有任何数对差的绝对值为 3 。
输入:nums = [3,2,1,5,4], k = 2 输出:3 解释:差的绝对值为 2 的数对为: - [(3),2,(1),5,4] - [(3),2,1,(5),4] - [3,(2),1,5,(4)]
来源:力扣(LeetCode) 链接:https://leetcode-cn.com/problems/count-number-of-pairs-with-absolute-difference-k 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
The text was updated successfully, but these errors were encountered:
func countKDifference(nums []int, k int) int { var r int for i := 0; i < len(nums); i++ { for j := i; j < len(nums); j++ { diff := nums[i] - nums[j] if diff == k || diff == -k { r++ } } } return r }
func countKDifference(nums []int, k int) int { var r int m := make(map[int]int) for _, v := range nums { m[v]++ } for _, v := range nums { r += m[v+k] r += m[v-k] m[v]-- } return r }
func countKDifference(nums []int, k int) int { var r int m := make(map[int]int) for _, v := range nums { r += m[v+k] r += m[v-k] m[v]++ } return r }
Sorry, something went wrong.
No branches or pull requests
给你一个整数数组
nums
和一个整数k
,请你返回数对(i, j)
的数目,满足i < j
且|nums[i] - nums[j]| == k
。|x|
的值定义为:如果
x >= 0
,那么值为x
。如果
x < 0
,那么值为-x
。示例 1:
示例 2:
示例 3:
提示:
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/count-number-of-pairs-with-absolute-difference-k
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
The text was updated successfully, but these errors were encountered: