algorithm/CS-Notes
1
0
Fork 0
mirror of https://github.com/CyC2018/CS-Notes.git synced 2025-07-09 20:32:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

修正leetcode题解笔误

Browse Source 
只差->之差
This commit is contained in:
rex
2019-01-29 14:29:17 +08:00
committed by GitHub
parent 0fccc54079
commit af181cf1c6
1 changed files with 1 additions and 1 deletions
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) {