update: 77

Author: hijiangtao

README.md

@@ -59,6 +59,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 71  | [Simplify Path](https://leetcode.com/problems/simplify-path/)                                                                                   | [JavaScript](./src/simplify-path/res.js)                                                                              | Medium     |
 | 73  | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)                                                                           | [JavaScript](./src/set-matrix-zeroes/res.js)                                                                          | Medium     |
 | 75  | [Sort Colors](https://leetcode.com/problems/sort-colors/)                                                                                       | [JavaScript](./src/sort-colors/res.js)                                                                                | Medium     |
+| 77  | [combinations](https://leetcode.com/problems/combinations/)                                                                                     | [TypeScript](./src/combinations/res.ts)                                                                               | Medium     |
 | 80  | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)                                 | [JavaScript](./src/remove-duplicates-from-sorted-array-ii/res.js)                                                     | Medium     |
 | 81  | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)                                           | [JavaScript](./src/search-in-rotated-sorted-array-ii/res.js)                                                          | Medium     |
 | 88  | [	Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)                                                                        | [JavaScript](./src/merge-sorted-array/res.js)                                                                         | Medium     |

src/combinations/res.ts

@@ -0,0 +1,26 @@
+function iterateNums(nums: number[], k: number): number[][] {
+    if (k === 0) {
+        return [];
+    }
+
+    const result: number[][] = [];
+    nums.forEach((num, index) => {
+        const newNums = nums.slice(index+1);
+        const newResult = iterateNums([...newNums], k - 1);
+
+        if (newResult.length) {
+            newResult.forEach(item => {
+                result.push([num, ...item]);
+            });
+        } else {
+            result.push([num]);
+        }
+    });
+
+    return result.filter(item => item.length === k);
+}
+
+function combine(n: number, k: number): number[][] {
+    const nums = (new Array(n).fill(0)).map((_, index) => index + 1);
+    return iterateNums(nums, k);
+};

src/permutations-ii/res.ts

@@ -10,6 +10,7 @@ function getUniqueList(numsCountMap: { [key in number]: number }): number[][] {
 
         if (currentCount) {
             const newNumsCountMap = { ...numsCountMap };
+            // @ts-ignore
             newNumsCountMap[key]--;
             for (let newKey in newNumsCountMap) {
                 if (!newNumsCountMap[newKey]) {