377

Author: lazzzis

377/Solution.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int combinationSum4(int[] nums, int target) {
+        Map<Integer, Integer> map = new HashMap<>();
+        map.put(0, 1);
+        for (int i = 0; i <= target; i++) {
+            int sum = 0;
+            for (int n : nums) {
+                sum += map.getOrDefault(i - n, 0);
+            }
+            if (sum != 0) {
+                map.put(i, sum);
+            }
+        }
+        return map.getOrDefault(target, 0);
+    }
+}

README.md

@@ -133,11 +133,12 @@
 - [312 Burst Balloons](./312)
 - [337 House Robber III](./337)
 - [341 Flatten Nested List Iterator](./341)
+- [347 Top K Frequent Elements](./347)
 - [349 Intersection of Two Arrays](./349)
 - [350 Intersection of Two Arrays II](./350)
+- [377 Combination Sum IV](./377)
 - [393 UTF-8 Validation](./393)
 - [398 Random Pick Index](./398)
-- [347 Top K Frequent Elements](./347)
 - [414 Third Maximum Number](./414)
 - [415 Add Strings](./415)
 - [442 Find All Duplicates in an Array](./442)