add: Group Anagrams

Author: hijiangtao

README.md

@@ -29,6 +29,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 |43|[Multiply Strings](https://leetcode.com/problems/multiply-strings/) | [JavaScript](./src/multiply-strings/res.js)|Medium|
 |46|[Permutations](https://leetcode.com/problems/permutations/) | [JavaScript](./src/permutations/res.js)|Medium|
 |48|[Rotate Image](https://leetcode.com/problems/rotate-image/) | [JavaScript](./src/rotate-image/res.js)|Medium|
+|49|[Group Anagrams](https://leetcode.com/problems/anagrams/) | [JavaScript](./src/anagrams/res.js)|Medium|
 |54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | [JavaScript](./src/spiral-matrix/res.js)|Medium|
 |66|[Plus One](https://leetcode.com/problems/plus-one/) | [JavaScript](./src/plus-one/res.js)|Easy|
 |69|[Sqrt(x)](https://leetcode.com/problems/sqrtx/) | [JavaScript](./src/sqrtx/res.js)|Easy|

src/anagrams/res.js

@@ -0,0 +1,34 @@
+/**
+ * res.js
+ * @authors Joe Jiang (hijiangtao@gmail.com)
+ * @date    2017-05-10 22:14:38
+ *
+ * @param {string[]} strs
+ * @return {string[][]}
+ */
+let groupAnagrams = function(strs) {
+    let len = strs.length;
+    if (!len) return [];
+
+    let hashmap = new Map();
+    for (let i = 0; i < len; i++) {
+        let tmparr = strs[i].split('');
+        tmparr.sort();
+        tmparr = tmparr.join();
+        if (!hashmap.has(tmparr)) {
+            hashmap.set(tmparr, [strs[i]]);
+        } else {
+            let tmp = hashmap.get(tmparr);
+            tmp.push(strs[i]);
+            hashmap.set(tmparr, tmp);
+        }
+    }
+
+    let res = [];
+    console.log(hashmap);
+    for (let [key, value] of hashmap) {
+        res.push(value);
+    }
+
+    return res;
+};