edit 377

fishercoder1534 · fishercoder1534 · commit 5808446c1f16 · 2017-07-19T17:32:59.000-07:00
diff --git a/README.md b/README.md
@@ -208,7 +208,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |385|[Mini Parser](https://leetcode.com/problems/mini-parser/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MiniParser.java)| O(n)|O(h) | Medium| Stack
 |382|[Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_382.java)| O(1)|O(n) | Medium| Reservoir Sampling
 |379|[Design Phone Directory](https://leetcode.com/problems/design-phone-directory/)|[Solution](../master/src/main/java/com/fishercoder/solutions/DesignPhoneDirectory.java)| O(1)|O(n) | Medium| 
-|377|[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)|[Solution](../master/src/main/java/com/fishercoder/solutions/CombinationSumIV.java)| O(?)|O(?) | Medium|
+|377|[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_377.java)| O(?)|O(?) | Medium|
 |376|[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_376.java)| O(n)|O(1) | Medium| DP, Greedy
 |375|[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_375.java)| O(n^2)|O(n^2) | Medium| DP
 |374|[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)|[Solution](../master/src/main/java/com/fishercoder/solutions/GuessNumberHigherorLower.java)| O(logn)|O(1) | Easy| Binary Search
diff --git a/src/main/java/com/fishercoder/solutions/_377.java b/src/main/java/com/fishercoder/solutions/_377.java
@@ -5,7 +5,8 @@
 import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.List;
-/**Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.
+/**Given an integer array with all positive numbers and no duplicates,
+ * find the number of possible combinations that add up to a positive integer target.
 
  Example:
 
@@ -24,14 +25,15 @@
  Note that different sequences are counted as different combinations.
 
  Therefore the output is 7.
+
  Follow up:
  What if negative numbers are allowed in the given array?
  How does it change the problem?
  What limitation we need to add to the question to allow negative numbers?*/
-public class CombinationSumIV {
-    //since this question doesn't require to return all the combination result, instead, it just wants one number, we could use DP
-    //the idea is similar to Climbing Stairs.
-    //adopted this solution: https://discuss.leetcode.com/topic/52186/my-3ms-java-dp-solution
+public class _377 {
+    /**since this question doesn't require to return all the combination result, instead, it just wants one number, we could use DP
+    the idea is similar to Climbing Stairs.
+    adopted this solution: https://discuss.leetcode.com/topic/52186/my-3ms-java-dp-solution*/
     public int combinationSum4(int[] nums, int target){
         Arrays.sort(nums);
         int[] result = new int[target+1];
@@ -68,7 +70,7 @@ private void backtracking(int start, int[] nums, int target, ArrayList temp,
     }
     
     public static void main(String...strings){
-        CombinationSumIV test = new CombinationSumIV();
+        _377 test = new _377();
         int[] nums = new int[]{1,2,3};
         int target = 4;
         CommonUtils.printListList(test.combinationSum4_printout(nums, target));
