FilesExpand file tree

 master

/

GroupAnagrams.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

40 lines (38 loc) · 1021 Bytes

 master

/

GroupAnagrams.java

Copy path

Top

File metadata and controls

• Code
• Blame

40 lines (38 loc) · 1021 Bytes

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

package com.yangchd.leetcode.medium;

import java.util.*;

/**

* @author yangchd 2018/9/21.

*

* 49. Group Anagrams

* Given an array of strings, group anagrams together.

*

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

* Output:

* [

* ["ate","eat","tea"],

* ["nat","tan"],

* ["bat"]

* ]

*

* Note:

* All inputs will be in lowercase.

* The order of your output does not matter.

*

*/

public class GroupAnagrams {

class Solution {

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

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

for (String s : strs) {

char[] a = s.toCharArray();

Arrays.sort(a);

String key = new String(a);

if (!map.containsKey(key)) {

map.put(key, new ArrayList<String>());

}

map.get(key).add(s);

}

return new ArrayList<List<String>>(map.values());

}

}

}