fix: remove useless comment

lucifer · lucifer · commit 23654b88741a · 2020-01-04T21:26:50.000+08:00
diff --git a/problems/494.target-sum.md b/problems/494.target-sum.md
@@ -1,6 +1,5 @@
-
-
 ## 题目地址
+
 https://leetcode.com/problems/target-sum/description/
 
 ## 题目描述
@@ -11,9 +10,9 @@ You are given a list of non-negative integers, a1, a2, ..., an, and a target, S.
 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. 
+Input: nums is [1, 1, 1, 1, 1], S is 3.
 Output: 5
-Explanation: 
+Explanation:
 
 -1+1+1+1+1 = 3
 +1-1+1+1+1 = 3
@@ -28,9 +27,10 @@ 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.
 
 ```
+
 ## 思路
 
-题目是给定一个数组，让你在数字前面添加 `+`或者`-`，使其和等于target.
+题目是给定一个数组，让你在数字前面添加 `+`或者`-`，使其和等于 target.
 
 ![494.target-sum](../assets/problems/494.target-sum.png)
 
@@ -48,62 +48,22 @@ Your output answer is guaranteed to be fitted in a 32-bit integer.
 
 ![494.target-sum-3](../assets/problems/494.target-sum-3.png)
 
-因此问题转化为，求解`sumCount(nums, target)`,即nums数组中能够组成
-target的总数一共有多少种，这是一道我们之前做过的题目，使用动态规划可以解决。
+因此问题转化为，求解`sumCount(nums, target)`,即 nums 数组中能够组成
+target 的总数一共有多少种，这是一道我们之前做过的题目，使用动态规划可以解决。
 
 ## 关键点解析
 
 - 对元素进行分组，分组的依据是符号， 是`+` 或者 `-`
 - 通过数学公式推导可以简化我们的求解过程，这需要一点`数学知识和数学意识`
 
 ## 代码
+
 ```js
 /*
  * @lc app=leetcode id=494 lang=javascript
  *
  * [494] Target Sum
  *
- * https://leetcode.com/problems/target-sum/description/
- *
- * algorithms
- * Medium (44.86%)
- * Total Accepted:    89.3K
- * Total Submissions: 198.5K
- * Testcase Example:  '[1,1,1,1,1]\n3'
- *
- *
- * 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.
- *
- *
  */
 // 这个是我们熟悉的问题了
 // 我们这里需要求解的是nums里面有多少种可以组成target的方式
@@ -135,4 +95,4 @@ var findTargetSumWays = function(nums, S) {
 
 ## 扩展
 
-如果这道题目并没有限定所有的元素以及target都是正数怎么办？
+如果这道题目并没有限定所有的元素以及 target 都是正数怎么办？
diff --git a/problems/518.coin-change-2.md b/problems/518.coin-change-2.md
@@ -123,64 +123,6 @@ return dp[dp.length - 1];
  *
  * [518] Coin Change 2
  *
- * https://leetcode.com/problems/coin-change-2/description/
- *
- * algorithms
- * Medium (41.57%)
- * Total Accepted:    39.7K
- * Total Submissions: 94.6K
- * Testcase Example:  '5\n[1,2,5]'
- *
- * You are given coins of different denominations and a total amount of money.
- * Write a function to compute the number of combinations that make up that
- * amount. You may assume that you have infinite number of each kind of
- * coin.
- *
- *
- *
- *
- *
- *
- * Example 1:
- *
- *
- * Input: amount = 5, coins = [1, 2, 5]
- * Output: 4
- * Explanation: there are four ways to make up the amount:
- * 5=5
- * 5=2+2+1
- * 5=2+1+1+1
- * 5=1+1+1+1+1
- *
- *
- * Example 2:
- *
- *
- * Input: amount = 3, coins = [2]
- * Output: 0
- * Explanation: the amount of 3 cannot be made up just with coins of 2.
- *
- *
- * Example 3:
- *
- *
- * Input: amount = 10, coins = [10]
- * Output: 1
- *
- *
- *
- *
- * Note:
- *
- * You can assume that
- *
- *
- * 0 <= amount <= 5000
- * 1 <= coin <= 5000
- * the number of coins is less than 500
- * the answer is guaranteed to fit into signed 32-bit integer
- *
- *
  */
 /**
  * @param {number} amount
