Advertisement
Guest User

Untitled

a guest
Feb 6th, 2016
52
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.44 KB | None | 0 0
  1. public class Solution {
  2. public boolean containsNearbyDuplicate(int[] nums, int k) {
  3.  
  4. Map<Integer,Integer> map = new HashMap<Integer,Integer>();
  5.  
  6. for(int i=0;i<nums.length;i++)
  7. {
  8. if(map.containsKey(nums[i]))
  9. {
  10. int pre = map.get(nums[i]);
  11. if(i-pre<=k) return true;
  12. }
  13. map.put(nums[i],i);
  14. }
  15. return false;
  16. }
  17. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement