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.
Example 1:
Input: nums = [1,2,3,1], k = 3
Output: true
Example 2:
Input: nums = [1,0,1,1], k = 1
Output: true
Example 3:
Input: nums = [1,2,3,1,2,3], k = 2
Output: false
Here's my code:
class Solution(object):
def containsNearbyDuplicate(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: bool
"""
def helper(lnums, n):
if len(lnums) == 0 and n == 0:
return False
elif len(lnums) > n:
for i in lnums[1:n]:
if i == lnums[0]:
return True
lnums.pop(0)
return helper(lnums, n)
else:
return False
return helper(nums, k)
Can anyone point out why I'm doing this wrong??? I know there's something wrong in the elif. But I have no idea why this doesn't work.