Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //nema duplikati
- //ako se bara vnesuvanje na elementi so O(n) kompleksnost
- Set<Integer> hashIntegerSet = new HashSet<>();
- for (int i = 1; i <= 10; i++) {
- hashIntegerSet.add(i);
- hashIntegerSet.add(i);
- }
- System.out.println(hashIntegerSet);
- //redosledot se izmestuva
- //ako sakame da e zadrzen redosledot treba da iskoristime Linked Hash Set
- Set<String> hashStringSet = new HashSet<>();
- hashStringSet.add("FINKI");
- hashStringSet.add("finki");
- hashStringSet.add("NP");
- hashStringSet.add("Napredno");
- System.out.println(hashStringSet);
- //Linked Hash Set se koristi za zacuvuvanje na redosledot an vnesuvanje
- Set<String> linkedHashSet=new LinkedHashSet<>();
- linkedHashSet.add("FINKI");
- linkedHashSet.add("finki");
- linkedHashSet.add("NP");
- linkedHashSet.add("Napredno");
- System.out.println(linkedHashSet);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement