Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
// Java Coding Challenge - 09: Find out duplicate numbers using HashSe...
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//Title of this code //'main' method must be in a class 'Rextester'. //Compiler version 1.8.0_45 //1, 5, 7, 54, 62, 2, 1, 54, 24, 1 import java.util.*; import java.lang.*; class Rextester { public static void main(String args[]) { int[] numbers = {1, 5, 7, 54, 62, 2, 1, 54, 24, 1}; Set<Integer> set = new HashSet<Integer>(); for (int n : numbers) { boolean unique = set.add(n); if (!unique) //(!unique == false) System.out.println("Duplicate: " + n); } } }
[
+
]
Show input
Compilation time: 1.13 sec, absolute running time: 0.14 sec, cpu time: 0.07 sec, memory peak: 31 Mb, absolute service time: 1.28 sec
fork mode
|
history
|
discussion