[Leetcode]49 anagrams

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

http://blog.csdn.net/linhuanmars/article/details/21664747

Public class solution {    public list<string> anagrams ( String[] strs)  {                 int len = strs.length;                 Map<Map<Integer, Integer>, List<String>>  Map = new hashmap<> ();        for  (String  s : strs)         {             map<integer, integer> pattern = pattern (s);             list<string> list =  map.get (pattern);            if  (list  == null) &NBSP;&NBsp;              list = new  ArrayList<String> ();             List.add (s);             map.put (pattern, list );        }                 List<String> toReturn = new ArrayList< > (;        for ) (list<string> lists :  Map.values ())         {             if  (Lists.size ()  > 1)              {                 toreturn.addall(lists);            }         }        return toReturn;     }        private static final int char _size = 26;        // assume  ' A - z '     private map<integer, integer> pattern (String s)      {        map<integer, integer> pattern  = new HashMap<> (;        for ) (char c  : s.tochararray ())         {             int v = c -  ' A ';          &nbsP;  integer occr = pattern.get (v);             if  (occr == null)                  occr = 0;             occr ++;             Pattern.put (V,&NBSP;OCCR);        }         return pattern;    }}

[Leetcode]49 anagrams