码迷,mamicode.com
首页 > 编程语言 > 详细

Java for LeetCode 219 Contains Duplicate II

时间:2015-06-09 23:20:17      阅读:134      评论:0      收藏:0      [点我收藏+]

标签:

Given an array of integers and an integer k, find out whether there 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.

解题思路:

HashMap,JAVA实现如下:

    public boolean containsNearbyDuplicate(int[] nums, int k) {
        HashMap<Integer,Integer> hm=new HashMap<Integer,Integer>();
        for(int i=0;i<nums.length;i++){
        	if(hm.containsKey(nums[i])&&i-hm.get(nums[i])<=k)
        		return true;
        	hm.put(nums[i], i);
        }
        return false;
    }

 

Java for LeetCode 219 Contains Duplicate II

标签:

原文地址:http://www.cnblogs.com/tonyluis/p/4564636.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!