StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Merge pull request #553 from todorex/patch-2

Browse Source 
修正leetcode题解笔误
This commit is contained in:
CyC2018 2019-01-29 14:31:29 +08:00 committed by GitHub
commit e68dcc8c41
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
docs/notes/Leetcode 题解.md
View File

@ -5694,7 +5694,7 @@ Output: 5
Explanation: The longest harmonious subsequence is [3,2,2,2,3]. Explanation: The longest harmonious subsequence is [3,2,2,2,3].
``` ```
和谐序列中最大数和最小数只差正好为 1，应该注意的是序列的元素不一定是数组的连续元素。 和谐序列中最大数和最小数之差正好为 1，应该注意的是序列的元素不一定是数组的连续元素。
```java ```java
public int findLHS(int[] nums) { public int findLHS(int[] nums) {