leetcode-java-219. Contains Duplicate II

最新推荐文章于 2016-08-28 10:10:49 发布

github_34514750

最新推荐文章于 2016-08-28 10:10:49 发布

阅读量522

点赞数

分类专栏： leetcode 文章标签： leetcode java

本文链接：https://blog.csdn.net/github_34514750/article/details/52335200

版权

leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

/*
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.
 */
/*
思路：使用map，更新value，但是超时了！！，于是发现map.put(nums[i],i);在fi和else中都有，
则优化一下就可以了！
 */
 public class Solution {
     public boolean containsNearbyDuplicate(int[] nums, int k) {
         Map<Integer,Integer> map = new HashMap<Integer,Integer>();
         int len = nums.length,
             i = 0;

         for(;i < len;i++) {
             if(!map.containsKey(nums[i])) {
                 map.put(nums[i],i);
             }else{
                 if((i - map.get(nums[i])) <= k) {
                     return true;
                 }
                 map.put(nums[i],i);
             }
         }
         return false;
     }
 }


 public class Solution {
     public boolean containsNearbyDuplicate(int[] nums, int k) {
         Map<Integer,Integer> map = new HashMap<Integer,Integer>();
         int len = nums.length,
             i = 0;

         for(;i < len;i++) {
             if(map.containsKey(nums[i])) {
                 if((i - map.get(nums[i])) <= k) {
                     return true;
                 }
             }
             map.put(nums[i],i);
         }
         return false;
     }
 }