auto commit
This commit is contained in:
CyC2018
parent
bcd9eedc12
commit
8ac2f15362
|
|
@ -13,9 +13,9 @@
|
|||
|
||||
# 1. 有序数组的 Two Sum
|
||||
|
||||
167\. Two Sum II - Input array is sorted (Easy)
|
||||
67\. 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/)
|
||||
<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>
|
||||
|
||||
```html
|
||||
Input: numbers={2, 7, 11, 15}, target=9
|
||||
|
|
@ -49,9 +49,9 @@ public int[] twoSum(int[] numbers, int target) {
|
|||
|
||||
# 2. 两数平方和
|
||||
|
||||
633. Sum of Square Numbers (Easy)
|
||||
633. Sum of Square Numbers (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/sum-of-square-numbers/description/) / [力扣](https://leetcode-cn.com/problems/sum-of-square-numbers/description/)
|
||||
<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>
|
||||
|
||||
```html
|
||||
Input: 5
|
||||
|
|
@ -80,9 +80,9 @@ public boolean judgeSquareSum(int c) {
|
|||
|
||||
# 3. 反转字符串中的元音字符
|
||||
|
||||
345. Reverse Vowels of a String (Easy)
|
||||
345. Reverse Vowels of a String (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/reverse-vowels-of-a-string/description/) / [力扣](https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/)
|
||||
<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>
|
||||
|
||||
```html
|
||||
Given s = "leetcode", return "leotcede".
|
||||
|
|
@ -115,9 +115,9 @@ public String reverseVowels(String s) {
|
|||
|
||||
# 4. 回文字符串
|
||||
|
||||
680. Valid Palindrome II (Easy)
|
||||
680. Valid Palindrome II (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/valid-palindrome-ii/description/) / [力扣](https://leetcode-cn.com/problems/valid-palindrome-ii/description/)
|
||||
<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>
|
||||
|
||||
```html
|
||||
Input: "abca"
|
||||
|
|
@ -149,9 +149,9 @@ private boolean isPalindrome(String s, int i, int j) {
|
|||
|
||||
# 5. 归并两个有序数组
|
||||
|
||||
88. Merge Sorted Array (Easy)
|
||||
88. Merge Sorted Array (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/merge-sorted-array/description/) / [力扣](https://leetcode-cn.com/problems/merge-sorted-array/description/)
|
||||
<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>
|
||||
|
||||
```html
|
||||
Input:
|
||||
|
|
@ -185,9 +185,9 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {
|
|||
|
||||
# 6. 判断链表是否存在环
|
||||
|
||||
141. Linked List Cycle (Easy)
|
||||
141. Linked List Cycle (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/linked-list-cycle/description/) / [力扣](https://leetcode-cn.com/problems/linked-list-cycle/description/)
|
||||
<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>
|
||||
|
||||
使用双指针，一个指针每次移动一个节点，一个指针每次移动两个节点，如果存在环，那么这两个指针一定会相遇。
|
||||
|
||||
|
|
@ -210,9 +210,9 @@ public boolean hasCycle(ListNode head) {
|
|||
|
||||
# 7. 最长子序列
|
||||
|
||||
524. Longest Word in Dictionary through Deleting (Medium)
|
||||
524. Longest Word in Dictionary through Deleting (Medium)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/) / [力扣](https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/)
|
||||
<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>
|
||||
|
||||
```
|
||||
Input:
|
||||
|
|
|
|||
|
|
@ -13,9 +13,9 @@
|
|||
|
||||
# 1. 有序数组的 Two Sum
|
||||
|
||||
167\. Two Sum II - Input array is sorted (Easy)
|
||||
67\. 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/)
|
||||
<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>
|
||||
|
||||
```html
|
||||
Input: numbers={2, 7, 11, 15}, target=9
|
||||
|
|
@ -49,9 +49,9 @@ public int[] twoSum(int[] numbers, int target) {
|
|||
|
||||
# 2. 两数平方和
|
||||
|
||||
633. Sum of Square Numbers (Easy)
|
||||
633. Sum of Square Numbers (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/sum-of-square-numbers/description/) / [力扣](https://leetcode-cn.com/problems/sum-of-square-numbers/description/)
|
||||
<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>
|
||||
|
||||
```html
|
||||
Input: 5
|
||||
|
|
@ -80,9 +80,9 @@ public boolean judgeSquareSum(int c) {
|
|||
|
||||
# 3. 反转字符串中的元音字符
|
||||
|
||||
345. Reverse Vowels of a String (Easy)
|
||||
345. Reverse Vowels of a String (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/reverse-vowels-of-a-string/description/) / [力扣](https://leetcode-cn.com/problems/reverse-vowels-of-a-string/description/)
|
||||
<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>
|
||||
|
||||
```html
|
||||
Given s = "leetcode", return "leotcede".
|
||||
|
|
@ -115,9 +115,9 @@ public String reverseVowels(String s) {
|
|||
|
||||
# 4. 回文字符串
|
||||
|
||||
680. Valid Palindrome II (Easy)
|
||||
680. Valid Palindrome II (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/valid-palindrome-ii/description/) / [力扣](https://leetcode-cn.com/problems/valid-palindrome-ii/description/)
|
||||
<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>
|
||||
|
||||
```html
|
||||
Input: "abca"
|
||||
|
|
@ -149,9 +149,9 @@ private boolean isPalindrome(String s, int i, int j) {
|
|||
|
||||
# 5. 归并两个有序数组
|
||||
|
||||
88. Merge Sorted Array (Easy)
|
||||
88. Merge Sorted Array (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/merge-sorted-array/description/) / [力扣](https://leetcode-cn.com/problems/merge-sorted-array/description/)
|
||||
<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>
|
||||
|
||||
```html
|
||||
Input:
|
||||
|
|
@ -185,9 +185,9 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {
|
|||
|
||||
# 6. 判断链表是否存在环
|
||||
|
||||
141. Linked List Cycle (Easy)
|
||||
141. Linked List Cycle (Easy)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/linked-list-cycle/description/) / [力扣](https://leetcode-cn.com/problems/linked-list-cycle/description/)
|
||||
<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>
|
||||
|
||||
使用双指针，一个指针每次移动一个节点，一个指针每次移动两个节点，如果存在环，那么这两个指针一定会相遇。
|
||||
|
||||
|
|
@ -210,9 +210,9 @@ public boolean hasCycle(ListNode head) {
|
|||
|
||||
# 7. 最长子序列
|
||||
|
||||
524. Longest Word in Dictionary through Deleting (Medium)
|
||||
524. Longest Word in Dictionary through Deleting (Medium)
|
||||
|
||||
[Leetcode](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/description/) / [力扣](https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/description/)
|
||||
<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>
|
||||
|
||||
```
|
||||
Input:
|
||||
|
|
|
|||
Loading…
Reference in New Issue
Block a user