From 1641eb801fc46ff9ee6ccb5cc03c0147321bbdb9 Mon Sep 17 00:00:00 2001
From: CodyWei <33363378+Codywei@users.noreply.github.com>
Date: Mon, 7 Jan 2019 10:12:07 +0800
Subject: [PATCH] =?UTF-8?q?234=E5=9B=9E=E6=96=87=E9=93=BE=E8=A1=A8?=
 =?UTF-8?q?=E5=A4=84=E7=9A=84=E4=B8=80=E4=B8=AA=E6=B3=A8=E8=A7=A3=E4=BF=AE?=
 =?UTF-8?q?=E6=94=B9?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

不确定我的理解是不是对的（-o-）
---
 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 23dfbefc..7ee1a2b7 100644
--- a/docs/notes/Leetcode 题解.md	
+++ b/docs/notes/Leetcode 题解.md	
@@ -4243,7 +4243,7 @@ public boolean isPalindrome(ListNode head) {
         slow = slow.next;
         fast = fast.next.next;
     }
-    if (fast != null) slow = slow.next;  // 偶数节点，让 slow 指向下一个节点
+    if (fast != null) slow = slow.next;  // 链表节点个数为奇数，让 slow 指向下一个节点
     cut(head, slow);                     // 切成两个链表
     return isEqual(head, reverse(slow));
 }