Contains Duplicate II

来源:互联网 发布:淘宝上最贵的商品 编辑:程序博客网 时间:2024/05/16 15:15
import java.util.Hashtable;public class Solution {    public boolean containsNearbyDuplicate(int[] nums, int k) {        Hashtable<Integer, Integer> intToIntHashtable = new Hashtable<Integer, Integer>();        for(int i = 0; i < nums.length; ++i) {            if(intToIntHashtable.containsKey(nums[i]) && i - intToIntHashtable.get(nums[i]) <= k) {                return true;            }else {                intToIntHashtable.put(nums[i], i);            }        }        return false;    }}
0 0