refactor 494

fishercoder1534 · fishercoder1534 · commit b1b698c40510 · 2020-07-15T07:59:18.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_494.java b/src/main/java/com/fishercoder/solutions/_494.java
@@ -1,33 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 494. Target Sum
- *
- *  You are given a list of non-negative integers, a1, a2, ..., an, and a target, S.
- *  Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol.
- *  Find out how many ways to assign symbols to make sum of integers equal to target S.
-
- Example 1:
-
- Input: nums is [1, 1, 1, 1, 1], S is 3.
- Output: 5
- Explanation:
-
- -1+1+1+1+1 = 3
- +1-1+1+1+1 = 3
- +1+1-1+1+1 = 3
- +1+1+1-1+1 = 3
- +1+1+1+1-1 = 3
-
- There are 5 ways to assign symbols to make the sum of nums be target 3.
-
- Note:
-
- The length of the given array is positive and will not exceed 20.
- The sum of elements in the given array will not exceed 1000.
- Your output answer is guaranteed to be fitted in a 32-bit integer.
-
- */
 public class _494 {
 
     public static class Solution1 {
