FilesExpand file tree

 master

/

Anagrams.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

40 lines (38 loc) · 1.38 KB

 master

/

Anagrams.java

Top

File metadata and controls

• Code
• Blame

40 lines (38 loc) · 1.38 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

/*

Author: King, wangjingui@outlook.com

Date: Dec 25, 2014

Problem: Anagrams

Difficulty: Easy

Source: https://oj.leetcode.com/problems/anagrams/

Notes:

Given an array of strings, return all groups of strings that are anagrams.

Note: All inputs will be in lower-case.

Solution: Sort the string to see if they're anagrams.

*/

import java.util.Map.Entry;

public class Solution {

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

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

HashMap<String, ArrayList<String>> group = new HashMap<String, ArrayList<String>>();

if (strs.length == 0) return res;

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

char[] tmp = strs[i].toCharArray();

Arrays.sort(tmp);

String s = String.valueOf(tmp);

if(group.containsKey(s))

(group.get(s)).add(strs[i]);

else {

ArrayList<String> t = new ArrayList<String>();

t.add(strs[i]);

group.put(s,t);

}

}

Iterator<Entry<String, ArrayList<String>>> iter = group.entrySet().iterator();

while (iter.hasNext()) {

Map.Entry entry = (Map.Entry) iter.next();

ArrayList<String> val = (ArrayList<String>) entry.getValue();

if (val.size() > 1) res.addAll(val);

}

return res;

}

}