题目:
Given an array of integers and an integer
k
, find out whether there are two distinct indices
i
and
j
in the array such that
nums[i] = nums[j]
and the
absolute
difference between
i
and
j
is at most
k
.
给定一个正数数组和一个正数k,当且仅当有两个不同的索引i和j,使nums[i]=nums[j],i和j的绝对差最大为k,若满足则返回true,否则返回false。
思路:
只要在循环中加一个判断所引致i和j的差是否小于等于k的语句就好。
虽然实现了,但是所运行时间超时,换一种写法,使用哈希集。