Skip to content

Commit 8ac2f15

Browse files
committed
auto commit
1 parent bcd9eed commit 8ac2f15

File tree

2 files changed

+28
-28
lines changed

2 files changed

+28
-28
lines changed

docs/notes/Leetcode 题解 - 双指针.md

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -13,9 +13,9 @@
1313

1414
# 1. 有序数组的 Two Sum
1515

16-
167\. Two Sum II - Input array is sorted (Easy)
16+
67\. Two Sum II - Input array is sorted (Easy) [Leetcode
1717

18-
[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/)
18+
<a href="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" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description) / [力扣](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description" target="_blank">力扣</a>
1919

2020
```html
2121
Input: numbers={2, 7, 11, 15}, target=9
@@ -49,9 +49,9 @@ public int[] twoSum(int[] numbers, int target) {
4949

5050
# 2. 两数平方和
5151

52-
633. Sum of Square Numbers (Easy)
52+
633. Sum of Square Numbers (Easy)
5353

54-
[Leetcode](https://leetcode.com/problems/sum-of-square-numbers/description/) / [力扣](https://leetcode-cn.com/problems/sum-of-square-numbers/description/)
54+
<a href="https://leetcode.com/problems/sum-of-square-numbers/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/sum-of-square-numbers/description/" target="_blank">力扣</a>
5555

5656
```html
5757
Input: 5
@@ -80,9 +80,9 @@ public boolean judgeSquareSum(int c) {
8080

8181
# 3. 反转字符串中的元音字符
8282

83-
345. Reverse Vowels of a String (Easy)
83+
345. Reverse Vowels of a String (Easy)
8484

85-
[Leetcode](https://leetcode.com/problems/reverse-vowels-of-a-string/description/) / [力扣](https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/)
85+
<a href="https://leetcode.com/problems/reverse-vowels-of-a-string/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/" target="_blank">力扣</a>
8686

8787
```html
8888
Given s = "leetcode", return "leotcede".
@@ -115,9 +115,9 @@ public String reverseVowels(String s) {
115115

116116
# 4. 回文字符串
117117

118-
680. Valid Palindrome II (Easy)
118+
680. Valid Palindrome II (Easy)
119119

120-
[Leetcode](https://leetcode.com/problems/valid-palindrome-ii/description/) / [力扣](https://leetcode-cn.com/problems/valid-palindrome-ii/description/)
120+
<a href="https://leetcode.com/problems/valid-palindrome-ii/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/valid-palindrome-ii/description/" target="_blank">力扣</a>
121121

122122
```html
123123
Input: "abca"
@@ -149,9 +149,9 @@ private boolean isPalindrome(String s, int i, int j) {
149149

150150
# 5. 归并两个有序数组
151151

152-
88. Merge Sorted Array (Easy)
152+
88. Merge Sorted Array (Easy)
153153

154-
[Leetcode](https://leetcode.com/problems/merge-sorted-array/description/) / [力扣](https://leetcode-cn.com/problems/merge-sorted-array/description/)
154+
<a href="https://leetcode.com/problems/merge-sorted-array/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/merge-sorted-array/description/" target="_blank">力扣</a>
155155

156156
```html
157157
Input:
@@ -185,9 +185,9 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {
185185

186186
# 6. 判断链表是否存在环
187187

188-
141. Linked List Cycle (Easy)
188+
141. Linked List Cycle (Easy)
189189

190-
[Leetcode](https://leetcode.com/problems/linked-list-cycle/description/) / [力扣](https://leetcode-cn.com/problems/linked-list-cycle/description/)
190+
<a href="https://leetcode.com/problems/linked-list-cycle/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/linked-list-cycle/description/" target="_blank">力扣</a>
191191

192192
使用双指针,一个指针每次移动一个节点,一个指针每次移动两个节点,如果存在环,那么这两个指针一定会相遇。
193193

@@ -210,9 +210,9 @@ public boolean hasCycle(ListNode head) {
210210

211211
# 7. 最长子序列
212212

213-
524. Longest Word in Dictionary through Deleting (Medium)
213+
524. Longest Word in Dictionary through Deleting (Medium)
214214

215-
[Leetcode](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/) / [力扣](https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/)
215+
<a href="https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/" target="_blank">力扣</a>
216216

217217
```
218218
Input:

notes/Leetcode 题解 - 双指针.md

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -13,9 +13,9 @@
1313

1414
# 1. 有序数组的 Two Sum
1515

16-
167\. Two Sum II - Input array is sorted (Easy)
16+
67\. Two Sum II - Input array is sorted (Easy) [Leetcode
1717

18-
[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/)
18+
<a href="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" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description) / [力扣](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/description" target="_blank">力扣</a>
1919

2020
```html
2121
Input: numbers={2, 7, 11, 15}, target=9
@@ -49,9 +49,9 @@ public int[] twoSum(int[] numbers, int target) {
4949

5050
# 2. 两数平方和
5151

52-
633. Sum of Square Numbers (Easy)
52+
633. Sum of Square Numbers (Easy)
5353

54-
[Leetcode](https://leetcode.com/problems/sum-of-square-numbers/description/) / [力扣](https://leetcode-cn.com/problems/sum-of-square-numbers/description/)
54+
<a href="https://leetcode.com/problems/sum-of-square-numbers/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/sum-of-square-numbers/description/" target="_blank">力扣</a>
5555

5656
```html
5757
Input: 5
@@ -80,9 +80,9 @@ public boolean judgeSquareSum(int c) {
8080

8181
# 3. 反转字符串中的元音字符
8282

83-
345. Reverse Vowels of a String (Easy)
83+
345. Reverse Vowels of a String (Easy)
8484

85-
[Leetcode](https://leetcode.com/problems/reverse-vowels-of-a-string/description/) / [力扣](https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/)
85+
<a href="https://leetcode.com/problems/reverse-vowels-of-a-string/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/" target="_blank">力扣</a>
8686

8787
```html
8888
Given s = "leetcode", return "leotcede".
@@ -115,9 +115,9 @@ public String reverseVowels(String s) {
115115

116116
# 4. 回文字符串
117117

118-
680. Valid Palindrome II (Easy)
118+
680. Valid Palindrome II (Easy)
119119

120-
[Leetcode](https://leetcode.com/problems/valid-palindrome-ii/description/) / [力扣](https://leetcode-cn.com/problems/valid-palindrome-ii/description/)
120+
<a href="https://leetcode.com/problems/valid-palindrome-ii/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/valid-palindrome-ii/description/" target="_blank">力扣</a>
121121

122122
```html
123123
Input: "abca"
@@ -149,9 +149,9 @@ private boolean isPalindrome(String s, int i, int j) {
149149

150150
# 5. 归并两个有序数组
151151

152-
88. Merge Sorted Array (Easy)
152+
88. Merge Sorted Array (Easy)
153153

154-
[Leetcode](https://leetcode.com/problems/merge-sorted-array/description/) / [力扣](https://leetcode-cn.com/problems/merge-sorted-array/description/)
154+
<a href="https://leetcode.com/problems/merge-sorted-array/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/merge-sorted-array/description/" target="_blank">力扣</a>
155155

156156
```html
157157
Input:
@@ -185,9 +185,9 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {
185185

186186
# 6. 判断链表是否存在环
187187

188-
141. Linked List Cycle (Easy)
188+
141. Linked List Cycle (Easy)
189189

190-
[Leetcode](https://leetcode.com/problems/linked-list-cycle/description/) / [力扣](https://leetcode-cn.com/problems/linked-list-cycle/description/)
190+
<a href="https://leetcode.com/problems/linked-list-cycle/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/linked-list-cycle/description/" target="_blank">力扣</a>
191191

192192
使用双指针,一个指针每次移动一个节点,一个指针每次移动两个节点,如果存在环,那么这两个指针一定会相遇。
193193

@@ -210,9 +210,9 @@ public boolean hasCycle(ListNode head) {
210210

211211
# 7. 最长子序列
212212

213-
524. Longest Word in Dictionary through Deleting (Medium)
213+
524. Longest Word in Dictionary through Deleting (Medium)
214214

215-
[Leetcode](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/) / [力扣](https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/)
215+
<a href="https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/" target="_blank">Leetcode</a> / <a href="https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/" target="_blank">力扣</a>
216216

217217
```
218218
Input:

0 commit comments

Comments
 (0)