Day 47.2.txt

49. Group Anagrams

Given an array of strings strs, group the anagrams together. You can return the answer in any order.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

 

Example 1:

Input: strs = ["eat","tea","tan","ate","nat","bat"]
Output: [["bat"],["nat","tan"],["ate","eat","tea"]]
Example 2:

Input: strs = [""]
Output: [[""]]
Example 3:

Input: strs = ["a"]
Output: [["a"]]
 

Constraints:

1 <= strs.length <= 104
0 <= strs[i].length <= 100
strs[i] consists of lower-case English letters.


class Solution {
    public List<List<String>> groupAnagrams(String[] s) {
        int i;
        HashMap<String,List<String>> nm=new HashMap<>();
        for(i=0;i<s.length;i++)
        {
            char c[]=s[i].toCharArray();
            Arrays.sort(c);
            String k=String.valueOf(c);
            if(!(nm.containsKey(k)))
                nm.put(k,new ArrayList<>());
            nm.get(k).add(s[i]);
        }
        return new ArrayList<>(nm.values());
    }
}