-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLearnSet.java
50 lines (36 loc) · 1.04 KB
/
LearnSet.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Set;
public class LearnSet {
public static void main(String[] args)
{
Set<Integer> s = new HashSet<>();
s.add(1);
s.add(5);
s.add(100);
s.add(50);
System.out.println(s);
s.remove(5);
System.out.println(s);
System.out.println(s.contains(100));
System.out.println(s.isEmpty());
System.out.println(s.size());
s.clear();
System.out.println(s);
System.out.println("\nLinked Hash Set");
Set<Integer> ls = new LinkedHashSet<>();
ls.add(1);
ls.add(5);
ls.add(100);
ls.add(50);
System.out.println(ls);
s.remove(5);
System.out.println(ls);
System.out.println(ls.contains(100));
System.out.println(ls.isEmpty());
System.out.println(ls.size());
s.clear();
System.out.println(ls);
// also learn .equals, toString() overrride and hashCode
}
}