219. Contains Duplicate II

Source: Internet
Author: User


Given an array of integers and a integer K, find out whether there is II distinct indices i and J in the array such that nums[i] = Nums[j] and the difference between I and Jare at most K.

Links: http://leetcode.com/problems/contains-duplicate-ii/


Use HashMap to save (nums[i],i) pair, if there is the same key and I-map.get (key) <= K, returns True. Otherwise, returns false after the traversal is complete.

Time Complexity-o (n), Space complexity-o (n)

 Public classSolution { Public BooleanContainsnearbyduplicate (int[] Nums,intk) {if(Nums = =NULL|| Nums.length = = 0)            return false; Map<integer, integer> map =NewHashmap<>();  for(inti = 0; i < nums.length; i++) {            if(Map.containskey (Nums[i])) {if(I-map.get (nums[i]) <=k)return true;        } map.put (Nums[i], i); }                return false; }}


219. Contains Duplicate II

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.