Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Coding Numbers - Duplicate - HashSet
//[Java]Coding Numbers - Duplicate - HashSet // // //Title of this code //'main' method must be in a class 'Rextester'. //Compiler version 1.8.0_72 import java.util.*; //java.util.HashSet //java.util.Set import java.lang.*; class Rextester { public static void main(String args[]) { int[] numbers={12,3,4,55,32,76,23,34,22,22,76}; Set<Integer> set = new HashSet<Integer>(); for(int n: numbers) { boolean unique = set.add(n); if (!unique) System.out.println("Duplicate: "+n); } } }
run
|
edit
|
history
|
help
0
Sum of power of digits-1
Problem_rstring
Coding Challenge - 02 (Odd numbers)
strstr() function / indexOf() function
Main
[Java] Coding - Reverse CODE - Mathematical Method
namingVariables
Menu Combination Sum
Roberto02
1(E)