题目
Contains Duplicate II
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 difference between i and j is at most k. Given an arra
阅读背景：
[C语言][LeetCode][219]Contains Duplicate II
来源：互联网
分享到：
