FilesExpand file tree

 master

/

UniqueItemsSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

37 lines (30 loc) · 1.1 KB

 master

/

UniqueItemsSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

37 lines (30 loc) · 1.1 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

import java.util.*;

import java.util.Map.*;

class UniqueItemsSort{

public static void main(String args[]){

String[] words = new String[] {"Apple", "Banana", "Apple", "Grapes", "Banana", "Pears", "Banana", "Pears", "Blueberry"};

HashMap<String, Integer> freqMap = new HashMap<String, Integer>();

for(int i=0;i<words.length;i++){

String key = words[i];

if(freqMap.containsKey(key)){

int fq = freqMap.get(key);

freqMap.put(key, fq+1);

}else{

freqMap.put(key, 1);

}

}

Comparator<Entry<String,Integer>> customComparator = new Comparator<Entry<String,Integer>>(){

public int compare(Entry<String, Integer> e1, Entry<String, Integer> e2){

if(e1.getValue() == e2.getValue()){

return e1.getKey().compareTo(e2.getKey());

}else {

return Integer.compare(e2.getValue(), e1.getValue());

}

}

};

List<Entry<String, Integer>> listEntries = new ArrayList<>(freqMap.entrySet());

System.out.println("before sort: " + listEntries);

Collections.sort(listEntries, customComparator);

System.out.println("after sort: " + listEntries);

}

}