LeetCode 219. 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.
原创
2016-04-12 20:43:04 ·
243 阅读 ·
0 评论