13
13
14
14
# 1. 有序数组的 Two Sum
15
15
16
- 167 \. Two Sum II - Input array is sorted (Easy)
16
+ 67 \. Two Sum II - Input array is sorted (Easy) [ Leetcode
17
17
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 >
19
19
20
20
``` html
21
21
Input: numbers={2, 7, 11, 15}, target=9
@@ -49,9 +49,9 @@ public int[] twoSum(int[] numbers, int target) {
49
49
50
50
# 2. 两数平方和
51
51
52
- 633 . Sum of Square Numbers (Easy)
52
+ 633 . Sum of Square Numbers (Easy)
53
53
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 >
55
55
56
56
``` html
57
57
Input: 5
@@ -80,9 +80,9 @@ public boolean judgeSquareSum(int c) {
80
80
81
81
# 3. 反转字符串中的元音字符
82
82
83
- 345 . Reverse Vowels of a String (Easy)
83
+ 345 . Reverse Vowels of a String (Easy)
84
84
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 >
86
86
87
87
``` html
88
88
Given s = "leetcode", return "leotcede".
@@ -115,9 +115,9 @@ public String reverseVowels(String s) {
115
115
116
116
# 4. 回文字符串
117
117
118
- 680 . Valid Palindrome II (Easy)
118
+ 680 . Valid Palindrome II (Easy)
119
119
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 >
121
121
122
122
``` html
123
123
Input: "abca"
@@ -149,9 +149,9 @@ private boolean isPalindrome(String s, int i, int j) {
149
149
150
150
# 5. 归并两个有序数组
151
151
152
- 88 . Merge Sorted Array (Easy)
152
+ 88 . Merge Sorted Array (Easy)
153
153
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 >
155
155
156
156
``` html
157
157
Input:
@@ -185,9 +185,9 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {
185
185
186
186
# 6. 判断链表是否存在环
187
187
188
- 141 . Linked List Cycle (Easy)
188
+ 141 . Linked List Cycle (Easy)
189
189
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 >
191
191
192
192
使用双指针,一个指针每次移动一个节点,一个指针每次移动两个节点,如果存在环,那么这两个指针一定会相遇。
193
193
@@ -210,9 +210,9 @@ public boolean hasCycle(ListNode head) {
210
210
211
211
# 7. 最长子序列
212
212
213
- 524 . Longest Word in Dictionary through Deleting (Medium)
213
+ 524 . Longest Word in Dictionary through Deleting (Medium)
214
214
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 >
216
216
217
217
```
218
218
Input:
0 commit comments