diff --git a/docs/notes/Leetcode 题解 - 双指针.md b/docs/notes/Leetcode 题解 - 双指针.md
index 512fd36d..4eb7213f 100644
--- a/docs/notes/Leetcode 题解 - 双指针.md
+++ b/docs/notes/Leetcode 题解 - 双指针.md
@@ -15,7 +15,7 @@
167\. Two Sum II - Input array is sorted (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/) / [力扣](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description/)
```html
Input: numbers={2, 7, 11, 15}, target=9
@@ -51,7 +51,7 @@ public int[] twoSum(int[] numbers, int target) {
633. Sum of Square Numbers (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/sum-of-square-numbers/description/) / [力扣](https://leetcode-cn.com/problems/sum-of-square-numbers/description/)
```html
Input: 5
@@ -82,7 +82,7 @@ public boolean judgeSquareSum(int c) {
345. Reverse Vowels of a String (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/reverse-vowels-of-a-string/description/) / [力扣](https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/)
```html
Given s = "leetcode", return "leotcede".
@@ -117,7 +117,7 @@ public String reverseVowels(String s) {
680. Valid Palindrome II (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/valid-palindrome-ii/description/) / [力扣](https://leetcode-cn.com/problems/valid-palindrome-ii/description/)
```html
Input: "abca"
@@ -151,7 +151,7 @@ private boolean isPalindrome(String s, int i, int j) {
88. Merge Sorted Array (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/merge-sorted-array/description/) / [力扣](https://leetcode-cn.com/problems/merge-sorted-array/description/)
```html
Input:
@@ -187,7 +187,7 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {
141. Linked List Cycle (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/linked-list-cycle/description/) / [力扣](https://leetcode-cn.com/problems/linked-list-cycle/description/)
使用双指针，一个指针每次移动一个节点，一个指针每次移动两个节点，如果存在环，那么这两个指针一定会相遇。
@@ -212,7 +212,7 @@ public boolean hasCycle(ListNode head) {
524. Longest Word in Dictionary through Deleting (Medium)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/) / [力扣](https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/)
```
Input:
diff --git a/notes/Leetcode 题解 - 双指针.md b/notes/Leetcode 题解 - 双指针.md
index 512fd36d..4eb7213f 100644
--- a/notes/Leetcode 题解 - 双指针.md
+++ b/notes/Leetcode 题解 - 双指针.md
@@ -15,7 +15,7 @@
167\. Two Sum II - Input array is sorted (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/) / [力扣](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description/)
```html
Input: numbers={2, 7, 11, 15}, target=9
@@ -51,7 +51,7 @@ public int[] twoSum(int[] numbers, int target) {
633. Sum of Square Numbers (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/sum-of-square-numbers/description/) / [力扣](https://leetcode-cn.com/problems/sum-of-square-numbers/description/)
```html
Input: 5
@@ -82,7 +82,7 @@ public boolean judgeSquareSum(int c) {
345. Reverse Vowels of a String (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/reverse-vowels-of-a-string/description/) / [力扣](https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/)
```html
Given s = "leetcode", return "leotcede".
@@ -117,7 +117,7 @@ public String reverseVowels(String s) {
680. Valid Palindrome II (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/valid-palindrome-ii/description/) / [力扣](https://leetcode-cn.com/problems/valid-palindrome-ii/description/)
```html
Input: "abca"
@@ -151,7 +151,7 @@ private boolean isPalindrome(String s, int i, int j) {
88. Merge Sorted Array (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/merge-sorted-array/description/) / [力扣](https://leetcode-cn.com/problems/merge-sorted-array/description/)
```html
Input:
@@ -187,7 +187,7 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {
141. Linked List Cycle (Easy)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/linked-list-cycle/description/) / [力扣](https://leetcode-cn.com/problems/linked-list-cycle/description/)
使用双指针，一个指针每次移动一个节点，一个指针每次移动两个节点，如果存在环，那么这两个指针一定会相遇。
@@ -212,7 +212,7 @@ public boolean hasCycle(ListNode head) {
524. Longest Word in Dictionary through Deleting (Medium)
-Leetcode / 力扣
+[Leetcode](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/) / [力扣](https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/)
```
Input: