add jz_offer_27

Author: 2xiao

src/.vuepress/sidebar.ts

@@ -454,6 +454,7 @@ export default sidebar({
           text: "剑指 Offer II",
           collapsible: true,
           children: [
+            "jz_offer_II_027",
             "jz_offer_II_031",
             "jz_offer_II_101"
           ],

src/leetcode/outline/plan/offer2_list.md

@@ -32,7 +32,7 @@ title: "剑指 Offer II 题解"
 | 剑指 Offer II 024 | [反转链表](https://leetcode.cn/problems/UHnkqh/) |  |  [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 025 | [链表中的两数相加](https://leetcode.cn/problems/lMSNwu/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`链表`](/leetcode/outline/tag/linked-list.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 026 | [重排链表](https://leetcode.cn/problems/LGjMqU/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ffb800>Medium</font> |
-| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
+| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_027) |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 028 | [展平多级双向链表](https://leetcode.cn/problems/Qv1Da2/) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`链表`](/leetcode/outline/tag/linked-list.md) [`双向链表`](/leetcode/outline/tag/doubly-linked-list.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 029 | [排序的循环链表](https://leetcode.cn/problems/4ueAj6/) |  |  [`链表`](/leetcode/outline/tag/linked-list.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 030 | [插入、删除和随机访问都是 O(1) 的容器](https://leetcode.cn/problems/FortPu/) |  |  [`设计`](/leetcode/outline/tag/design.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `2+` | <font color=#ffb800>Medium</font> |

src/leetcode/outline/solution_list.md

@@ -1,6 +1,6 @@
 # 1.3 LeetCode 题解
 
-已完成 304 道
+已完成 305 道
 
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------: | :------ | :------: | :------ | :------ |
@@ -305,6 +305,7 @@
 | 剑指 Offer 58 - I | [翻转单词顺序](https://leetcode.cn/problems/fan-zhuan-dan-ci-shun-xu-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_58_1) |  [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#15bd66>Esay</font> |
 | 剑指 Offer 61 | [扑克牌中的顺子](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_61_1) |  [`数组`](/leetcode/outline/tag/array.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#15bd66>Esay</font> |
 | 剑指 Offer 63 | [股票的最大利润](https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_63_1) |  [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> |
+| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_027) |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 031 | [最近最少使用缓存](https://leetcode.cn/problems/OrIXps/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_031) |  [`设计`](/leetcode/outline/tag/design.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 101 | [分割等和子集](https://leetcode.cn/problems/NUPfPr/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_101) |  [`数学`](/leetcode/outline/tag/mathematics.md) [`字符串`](/leetcode/outline/tag/string.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#15bd66>Esay</font> |
 | 面试题 16.25 | [LRU 缓存](https://leetcode.cn/problems/lru-cache-lcci/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/i_16.25) |  [`设计`](/leetcode/outline/tag/design.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ffb800>Medium</font> |

src/leetcode/outline/tag/linked-list.md

@@ -104,7 +104,7 @@
 | 剑指 Offer II 024 | [反转链表](https://leetcode.cn/problems/UHnkqh/) |  |  [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 025 | [链表中的两数相加](https://leetcode.cn/problems/lMSNwu/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`链表`](/leetcode/outline/tag/linked-list.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 026 | [重排链表](https://leetcode.cn/problems/LGjMqU/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ffb800>Medium</font> |
-| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
+| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_027) |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 028 | [展平多级双向链表](https://leetcode.cn/problems/Qv1Da2/) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`链表`](/leetcode/outline/tag/linked-list.md) [`双向链表`](/leetcode/outline/tag/doubly-linked-list.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 029 | [排序的循环链表](https://leetcode.cn/problems/4ueAj6/) |  |  [`链表`](/leetcode/outline/tag/linked-list.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 031 | [最近最少使用缓存](https://leetcode.cn/problems/OrIXps/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_031) |  [`设计`](/leetcode/outline/tag/design.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ffb800>Medium</font> |

src/leetcode/outline/tag/recursion.md

@@ -79,7 +79,7 @@
 | 剑指 Offer 64 | [求1+2+…+n](https://leetcode.cn/problems/qiu-12n-lcof/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`递归`](/leetcode/outline/tag/recursion.md) [`脑筋急转弯`](/leetcode/outline/tag/brain-teasers.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 024 | [反转链表](https://leetcode.cn/problems/UHnkqh/) |  |  [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 026 | [重排链表](https://leetcode.cn/problems/LGjMqU/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ffb800>Medium</font> |
-| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
+| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_027) |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
 | 面试题 02.05 | [链表求和](https://leetcode.cn/problems/sum-lists-lcci/) |  |  [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |
 | 面试题 02.06 | [回文链表](https://leetcode.cn/problems/palindrome-linked-list-lcci/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
 | 面试题 08.05 | [递归乘法](https://leetcode.cn/problems/recursive-mulitply-lcci/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |

src/leetcode/outline/tag/stack.md

@@ -171,7 +171,7 @@
 | 剑指 Offer 36 | [二叉搜索树与双向链表](https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_36_1) |  [`栈`](/leetcode/outline/tag/stack.md) [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) `4+` | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 025 | [链表中的两数相加](https://leetcode.cn/problems/lMSNwu/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`链表`](/leetcode/outline/tag/linked-list.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 026 | [重排链表](https://leetcode.cn/problems/LGjMqU/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ffb800>Medium</font> |
-| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
+| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_027) |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 036 | [后缀表达式](https://leetcode.cn/problems/8Zf90G/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`数组`](/leetcode/outline/tag/array.md) [`数学`](/leetcode/outline/tag/mathematics.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 037 | [小行星碰撞](https://leetcode.cn/problems/XagZNi/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`数组`](/leetcode/outline/tag/array.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 038 | [每日温度](https://leetcode.cn/problems/iIQa4I/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`数组`](/leetcode/outline/tag/array.md) [`单调栈`](/leetcode/outline/tag/monotonic-stack.md) | <font color=#ffb800>Medium</font> |

src/leetcode/outline/tag/two-pointers.md

@@ -210,7 +210,7 @@
 | 剑指 Offer II 022 | [链表中环的入口节点](https://leetcode.cn/problems/c32eOV/) |  |  [`哈希表`](/leetcode/outline/tag/hash-table.md) [`链表`](/leetcode/outline/tag/linked-list.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 023 | [两个链表的第一个重合节点](https://leetcode.cn/problems/3u1WK4/) |  |  [`哈希表`](/leetcode/outline/tag/hash-table.md) [`链表`](/leetcode/outline/tag/linked-list.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 026 | [重排链表](https://leetcode.cn/problems/LGjMqU/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ffb800>Medium</font> |
-| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) |  |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
+| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_027) |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 056 | [二叉搜索树中两个节点之和](https://leetcode.cn/problems/opLdQZ/) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `4+` | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 077 | [链表排序](https://leetcode.cn/problems/7WHec2/) |  |  [`链表`](/leetcode/outline/tag/linked-list.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) `2+` | <font color=#ffb800>Medium</font> |
 | 面试题 01.05 | [一次编辑](https://leetcode.cn/problems/one-away-lcci/) |  |  [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#ffb800>Medium</font> |

src/leetcode/problem/README.md

@@ -1,6 +1,6 @@
 # 第四章 LeetCode 题解
 
-已完成 304 道
+已完成 305 道
 
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------: | :------ | :------: | :------ | :------ |
@@ -305,6 +305,7 @@
 | 剑指 Offer 58 - I | [翻转单词顺序](https://leetcode.cn/problems/fan-zhuan-dan-ci-shun-xu-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_58_1) |  [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#15bd66>Esay</font> |
 | 剑指 Offer 61 | [扑克牌中的顺子](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_61_1) |  [`数组`](/leetcode/outline/tag/array.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#15bd66>Esay</font> |
 | 剑指 Offer 63 | [股票的最大利润](https://leetcode.cn/problems/gu-piao-de-zui-da-li-run-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_63_1) |  [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> |
+| 剑指 Offer II 027 | [回文链表](https://leetcode.cn/problems/aMhZSa/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_027) |  [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#15bd66>Esay</font> |
 | 剑指 Offer II 031 | [最近最少使用缓存](https://leetcode.cn/problems/OrIXps/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_031) |  [`设计`](/leetcode/outline/tag/design.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ffb800>Medium</font> |
 | 剑指 Offer II 101 | [分割等和子集](https://leetcode.cn/problems/NUPfPr/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_II_101) |  [`数学`](/leetcode/outline/tag/mathematics.md) [`字符串`](/leetcode/outline/tag/string.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#15bd66>Esay</font> |
 | 面试题 16.25 | [LRU 缓存](https://leetcode.cn/problems/lru-cache-lcci/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/i_16.25) |  [`设计`](/leetcode/outline/tag/design.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ffb800>Medium</font> |

src/leetcode/problem/jz_offer_II_027.md

@@ -0,0 +1,86 @@
+# [剑指 Offer II 27. 回文链表](https://leetcode.cn/problems/aMhZSa/)
+
+🟢 <font color=#15bd66>Esay</font>&emsp; 🔖&ensp; [`栈`](/leetcode/outline/tag/stack.md) [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) [`双指针`](/leetcode/outline/tag/two-pointers.md)&emsp; 🔗&ensp;[`LeetCode`](https://leetcode.cn/problems/aMhZSa/)
+
+## 题目
+
+给定一个链表的 **头节点** `head` ，请判断其是否为回文链表。
+
+如果一个链表是回文，那么链表节点序列从前往后看和从后往前看是相同的。
+
+**示例 1：**
+
+> 输入: head = [1,2,3,3,2,1]
+>
+> 输出: true
+
+**示例 2：**
+
+> 输入: head = [1,2]
+>
+> 输出: false
+
+**提示：**
+
+- 链表 L 的长度范围为 `[1, 10^5]`
+- `0 <= node.val <= 9`
+
+**进阶：**
+
+能否用 `O(n)` 时间复杂度和 `O(1)` 空间复杂度解决此题？
+
+::: warning
+
+本题与 LeetCode [第 234 题](./0234.md) 相同。
+
+:::
+
+## 解题思路
+
+这道题只需要在 [第 143 题](./0143.md) 上面改改就可以了，思路是完全一致的。
+
+- 先找到中间结点，然后反转中间结点后面到结尾的所有结点；
+- 最后依次判断头结点开始的结点和中间结点往后开始的结点是否相等；
+- 如果一直相等，就是回文链表，如果有不相等的，直接返回不是回文链表。
+
+## 代码
+
+```javascript
+/**
+ * @param {ListNode} head
+ * @return {boolean}
+ */
+var isPalindrome = function (head) {
+	if (!head || !head.next) return true;
+
+	// 找到中点
+	let slow = head;
+	let fast = head;
+	while (fast.next && fast.next.next) {
+		slow = slow.next;
+		fast = fast.next.next;
+	}
+
+	// 从中间开始反转链表
+	const middle = slow;
+	let cur = middle.next;
+	while (cur.next) {
+		let temp = cur.next;
+		cur.next = temp.next;
+		temp.next = middle.next;
+		middle.next = temp;
+	}
+
+	slow = head;
+	fast = middle.next;
+	while (fast) {
+		if (slow.val == fast.val) {
+			slow = slow.next;
+			fast = fast.next;
+		} else {
+			return false;
+		}
+	}
+	return true;
+};
+```