- 题目
- Given an array of strings, return all groups of strings that are anagrams.
- 首先简单介绍一下Anagram(回文构词法)。Anagrams是指由颠倒字母顺序组成的单词,比如“tea”会变成“eat”。
For example:
Input:["tea","and","ate","eat","den"]
Output: ["tea","ate","eat"]
package leetcode;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Iterator;
/**
* Given an array of strings, return all groups of strings that are anagrams.
*
* Note: All inputs will be in lower-case.
*/
public class Anagrams {
public static void main(String[] args) {
String[] strs =new String[]{"tea","eat","ate","and"};
Anagrams anagrams = new Anagrams();
ArrayList result =new ArrayList<>();
result = anagrams.anagrams(strs);
System.out.println("result's length is "+result.size());
System.out.print("result is "+"[ ");
Iterator iterator = result.iterator();
while (iterator.hasNext()) {
Object object = (Object) iterator.next();
System.out.print("\""+object+"\""+","+" ");
}
System.out.println("]");
}
public ArrayList<String> anagrams(String[] strs) {
ArrayList<String> ret = new ArrayList<String>();
ArrayList<String> ar = new ArrayList<String>();
for (String s : strs) {
char[] c = s.toCharArray();
Arrays.sort(c);
ar.add(new String(c));
}
int[] list = new int[strs.length];
int tmp = 0;
for (int i = 0; i < ar.size(); i++) {
if (list[i] == 0) {
list[i] = 1;
tmp = 1;
for (int j = i + 1; j < ar.size(); j++) {
if (list[j] == 0 && ar.get(i).equals(ar.get(j))) {
list[j] = 1;
tmp++;
}
}
if (tmp == 1) {
list[i] = 0;
}
}
}
for (int i = 0; i < list.length; i++) {
if (list[i] == 1)
ret.add(strs[i]);
}
return ret;
}
}