From af181cf1c60247758b7ac95d4ad498ec5c410505 Mon Sep 17 00:00:00 2001
From: rex <rex19951001@gmail.com>
Date: Tue, 29 Jan 2019 14:29:17 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BF=AE=E6=AD=A3leetcode=E9=A2=98=E8=A7=A3?=
 =?UTF-8?q?=E7=AC=94=E8=AF=AF?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

只差->之差
---
 docs/notes/Leetcode 题解.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/notes/Leetcode 题解.md b/docs/notes/Leetcode 题解.md
index 352dcbf3..5acc6093 100644
--- a/docs/notes/Leetcode 题解.md	
+++ b/docs/notes/Leetcode 题解.md	
@@ -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) {