219. Contains Duplicate II

最新推荐文章于 2020-04-19 07:30:50 发布

zg1g

最新推荐文章于 2020-04-19 07:30:50 发布

阅读量618

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode 数组

本文链接：https://blog.csdn.net/daigualu/article/details/71166985

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 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 absolute difference between i and j is at most k.

代码实现

 public bool ContainsNearbyDuplicate(int[] nums, int k)
        {
            Dictionary<int, int> dict = new Dictionary<int, int>(); //元素值，索引
            for (int i = 0; i < nums.Length; i++)
            {
                if (dict.ContainsKey(nums[i]))
                {
                    if (Math.Abs(i - dict[nums[i]]) <= k)
                        return true;
                    dict.Remove(nums[i]); //移调
                    dict.Add(nums[i], i);//添加最新的
                    continue;
                }
                dict.Add(nums[i], i);
            }
            return false;
        }