Merge pull request #553 from todorex/patch-2

修正leetcode题解笔误
2019-01-29 14:31:29 +08:00 · 2019-01-29 14:31:29 +08:00 · e68dcc8c41
commit e68dcc8c41
parent 0fccc54079 af181cf1c6
1 changed files with 1 additions and 1 deletions
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -5694,7 +5694,7 @@ Output: 5
 Explanation: The longest harmonious subsequence is [3,2,2,2,3].
 ```

-和谐序列中最大数和最小数只差正好为 1，应该注意的是序列的元素不一定是数组的连续元素。
+和谐序列中最大数和最小数之差正好为 1，应该注意的是序列的元素不一定是数组的连续元素。

 ```java
 public int findLHS(int[] nums) {