【字符串】Anagrams

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

Note: All inputs will be in lower-case.

题意：给定一个字符串数组，找出其中的兄弟字符串，即“tea","tae","eat"互为兄弟字符串，至少要有两个

public class Solution {
    public ArrayList<String> anagrams(String[] strs) {
        HashMap<String, Integer> map = new HashMap<String, Integer>();
        ArrayList<String> l = new ArrayList<String>();
        
        for(int i=0; i<strs.length; i++){
            char[] cs = strs[i].toCharArray();
            Arrays.sort(cs);
            String nStr = new String(cs);
            if(!map.containsKey(nStr)){
                map.put(nStr, i);
            }
            else{
                int index = map.get(nStr);
                if(index >= 0){//判断上一个是否已经添加进结果List中
                    l.add(strs[index]);
                    map.put(nStr, -1);
                }
                l.add(strs[i]);
            }
        }
        return l;
    }
}