fork download
copy 
  1. import java.util.*;
  2.  
  3. public class Main {
  4.     public static boolean containsNearbyDuplicateOptimized(int[] nums, int k) {
  5.         Map<Integer, Integer> numIndices = new HashMap<>();
  6.         for (int i = 0; i < nums.length; ++i) {
  7.             if (numIndices.containsKey(nums[i]) && i - numIndices.get(nums[i]) <= k) {
  8.                 return true;
  9.             }
  10.             numIndices.put(nums[i], i);
  11.         }
  12.         return false;
  13.     }
  14.  
  15.     public static void main(String[] args) {
  16.         int[] nums = {1, 1, 3, 1, 2, 3};
  17.         int k = 2;
  18.         if (containsNearbyDuplicateOptimized(nums, k)) {
  19.             System.out.println("There are two equal numbers within distance " + k);
  20.         } else {
  21.             System.out.println("No two equal numbers found within distance " + k);
  22.         }
  23.     }
  24. }
  25.  
Success #stdin #stdout 0.15s 55700KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
There are two equal numbers within distance 2
https://ideone.com/9WZUfk
language:
Java (HotSpot 12)
created:
12 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!