FilesExpand file tree

 master

/

GroupAnagrams.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

45 lines (42 loc) · 1.14 KB

 master

/

GroupAnagrams.java

Copy path

Top

File metadata and controls

• Code
• Blame

45 lines (42 loc) · 1.14 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

38

39

40

41

42

43

44

45

package String;

import java.util.ArrayList;

import java.util.Arrays;

import java.util.Collections;

import java.util.HashMap;

import java.util.LinkedList;

import java.util.List;

import java.util.Map;

/**

* Given an array of strings, group anagrams together.

*

* For example, given: ["eat","tea","tan","ate","nat","bat"], Return:

*

* [ ["ate","eat","tea"], ["nat","tan"], ["bat"] ]

*

* @author shuoyi.zhao

*

*/

public class GroupAnagrams {

public List<List<String>> groupAnagrams(String[] strs) {

if(strs == null || strs.length == 0)

return null;

Map<String, List<String>> map = new HashMap<String, List<String>>();

for(String str: strs){

char[] chars = str.toCharArray();

Arrays.sort(chars);

String tmp = new String(chars);

List<String> list = map.get(tmp);

if(list == null)

list = new LinkedList<String>();

list.add(str);

map.put(tmp, list);

}

List<List<String>> res = new ArrayList<List<String>>();

for(String str: map.keySet()){

List<String> words = map.get(str);

Collections.sort(words);

res.add(words);

}

return res;

}

}