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 jis at most k.
S
原创
2016-03-22 16:52:22 ·
340 阅读 ·
0 评论