课程内容提交
This commit is contained in:
MYP
794
DataStructureAndAlgorithm/08 Leetcode同步练习（三）.md
Normal file
794
DataStructureAndAlgorithm/08 Leetcode同步练习（三）.md
Normal file
@@ -0,0 +1,794 @@
|
||||
|
||||
# Leetcodeͬ<65><CDAC><EFBFBD><EFBFBD>ϰ<EFBFBD><CFB0><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
|
||||
## <20><>Ŀ01<30><31><EFBFBD>ϲ<EFBFBD><CFB2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
> - <20><><EFBFBD>ţ<EFBFBD>21
|
||||
> - <20>Ѷȣ<D1B6><C8A3><EFBFBD><EFBFBD><EFBFBD>
|
||||
> - https://leetcode-cn.com/problems/merge-two-sorted-lists/
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ϲ<EFBFBD>Ϊһ<EFBFBD><EFBFBD><EFBFBD>µ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ء<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͨ<EFBFBD><EFBFBD>ƴ<EFBFBD>Ӹ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>нڵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɵġ<EFBFBD>
|
||||
|
||||
**ʾ<><CABE><EFBFBD><EFBFBD>**
|
||||
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD>룺1->2->4, 1->3->4
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1->1->2->3->4->4
|
||||
```
|
||||
|
||||
**<EFBFBD>ο<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>**<2A><>
|
||||
|
||||
- ִ<>н<EFBFBD><D0BD><EFBFBD><EFBFBD><EFBFBD>ͨ<EFBFBD><CDA8>
|
||||
- ִ<><D6B4><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>108 ms, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 83.80% <20><><EFBFBD>û<EFBFBD>
|
||||
- <20>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD>ģ<EFBFBD>25.9 MB, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 5.85% <20><><EFBFBD>û<EFBFBD>
|
||||
|
||||
```c
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* public class ListNode {
|
||||
* public int val;
|
||||
* public ListNode next;
|
||||
* public ListNode(int x) { val = x; }
|
||||
* }
|
||||
*/
|
||||
public class Solution
|
||||
{
|
||||
public ListNode MergeTwoLists(ListNode l1, ListNode l2)
|
||||
{
|
||||
ListNode pHead = new ListNode(int.MaxValue);
|
||||
ListNode temp = pHead;
|
||||
|
||||
while (l1 != null && l2 != null)
|
||||
{
|
||||
if (l1.val < l2.val)
|
||||
{
|
||||
temp.next = l1;
|
||||
l1 = l1.next;
|
||||
}
|
||||
else
|
||||
{
|
||||
temp.next = l2;
|
||||
l2 = l2.next;
|
||||
}
|
||||
temp = temp.next;
|
||||
}
|
||||
|
||||
if (l1 != null)
|
||||
temp.next = l1;
|
||||
|
||||
if (l2 != null)
|
||||
temp.next = l2;
|
||||
|
||||
return pHead.next;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
---
|
||||
## <20><>Ŀ02<30><32>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD><D0B5>ظ<EFBFBD>Ԫ<EFBFBD><D4AA>
|
||||
|
||||
> - <20><><EFBFBD>ţ<EFBFBD>83
|
||||
> - <20>Ѷȣ<D1B6><C8A3><EFBFBD><EFBFBD><EFBFBD>
|
||||
> - https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/
|
||||
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>أ<EFBFBD>ʹ<EFBFBD><EFBFBD>ÿ<EFBFBD><EFBFBD>Ԫ<EFBFBD><EFBFBD>ֻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD>Ρ<EFBFBD>
|
||||
|
||||
|
||||
**ʾ<><CABE> 1:**
|
||||
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 1->1->2
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 1->2
|
||||
```
|
||||
|
||||
**ʾ<><CABE> 2:**
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 1->1->2->3->3
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 1->2->3
|
||||
```
|
||||
|
||||
**˼·**<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˫ָ<CBAB><D6B8><EFBFBD>ķ<EFBFBD>ʽ<EFBFBD><CABD>
|
||||
|
||||
`p1`<EFBFBD><EFBFBD>Ϊǰ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><EFBFBD>̽·<EFBFBD><EFBFBD>`p2`<EFBFBD><EFBFBD>Ϊ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD>Ԫ<EFBFBD>أ<EFBFBD>`p2.next`<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ȥ<EFBFBD><EFBFBD>`p1`<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD>Ԫ<EFBFBD>ض<EFBFBD><EFBFBD><EFBFBD>ժ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
**<EFBFBD>ο<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>**<2A><>
|
||||
|
||||
- ִ<>н<EFBFBD><D0BD><EFBFBD><EFBFBD><EFBFBD>ͨ<EFBFBD><CDA8>
|
||||
- ִ<><D6B4><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>160 ms, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 5.23% <20><><EFBFBD>û<EFBFBD>
|
||||
- <20>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD>ģ<EFBFBD>25.9 MB, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 5.72% <20><><EFBFBD>û<EFBFBD>
|
||||
|
||||
```c
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* public class ListNode {
|
||||
* public int val;
|
||||
* public ListNode next;
|
||||
* public ListNode(int x) { val = x; }
|
||||
* }
|
||||
*/
|
||||
|
||||
public class Solution
|
||||
{
|
||||
public ListNode DeleteDuplicates(ListNode head)
|
||||
{
|
||||
if (head == null)
|
||||
return head;
|
||||
|
||||
ListNode p1 = head.next;
|
||||
ListNode p2 = head;
|
||||
while (p1 != null)
|
||||
{
|
||||
if (p1.val == p2.val)
|
||||
p2.next = p1.next;
|
||||
else
|
||||
p2 = p2.next;
|
||||
p1 = p1.next;
|
||||
}
|
||||
return head;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
---
|
||||
## <20><>Ŀ03<30><33><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
> - <20><><EFBFBD>ţ<EFBFBD>141
|
||||
> - <20>Ѷȣ<D1B6><C8A3><EFBFBD><EFBFBD><EFBFBD>
|
||||
> - https://leetcode-cn.com/problems/linked-list-cycle/
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ж<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƿ<EFBFBD><EFBFBD>л<EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
Ϊ<EFBFBD>˱<EFBFBD>ʾ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>еĻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʹ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>`pos` <20><><EFBFBD><EFBFBD>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD>β<EFBFBD><CEB2><EFBFBD>ӵ<EFBFBD><D3B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD>λ<EFBFBD>ã<EFBFBD><C3A3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0 <20><>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD>`pos`<EFBFBD><EFBFBD> -1<><31><EFBFBD><EFBFBD><EFBFBD>ڸ<EFBFBD><DAB8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>û<EFBFBD>л<EFBFBD><D0BB><EFBFBD>
|
||||
|
||||
<b>ʾ<><CABE> 1</b><3E><>
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD>룺head = [3,2,0,-4], pos = 1
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>true
|
||||
<EFBFBD><EFBFBD><EFBFBD>ͣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>β<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ӵ<EFBFBD><EFBFBD>ڶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ㡣
|
||||
```
|
||||
|
||||
|
||||
|
||||
<b>ʾ<><CABE> 2</b><3E><>
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD>룺head = [1,2], pos = 0
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>true
|
||||
<EFBFBD><EFBFBD><EFBFBD>ͣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>β<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ӵ<EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD>ڵ㡣
|
||||
```
|
||||
|
||||
|
||||
<b>ʾ<><CABE> 3</b><3E><>
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD>룺head = [1], pos = -1
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>false
|
||||
<EFBFBD><EFBFBD><EFBFBD>ͣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>û<EFBFBD>л<EFBFBD><EFBFBD><EFBFBD>
|
||||
```
|
||||
|
||||
|
||||
<b><3E><><EFBFBD><EFBFBD></b><3E><>
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> O(1)<29><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
**˼·**<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˫ָ<CBAB><D6B8><EFBFBD>ķ<EFBFBD>ʽ<EFBFBD><CABD>
|
||||
|
||||
ͨ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>£<EFBFBD><EFBFBD>ж<EFBFBD><EFBFBD>Ƿ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ظ<EFBFBD><EFBFBD><EFBFBD>Ԫ<EFBFBD>أ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʹ<EFBFBD><EFBFBD>`Hash`<EFBFBD>ķ<EFBFBD>ʽ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֳ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҳ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʹ<EFBFBD><EFBFBD>˫ָ<EFBFBD><EFBFBD><EFBFBD>ķ<EFBFBD>ʽ<EFBFBD><EFBFBD>
|
||||
|
||||
<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>ָ<EFBFBD><EFBFBD> `p1` ÿ<><C3BF><EFBFBD>ƶ<EFBFBD><C6B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ㣬<DAB5>ڶ<EFBFBD><DAB6><EFBFBD>ָ<EFBFBD><D6B8> `p2` ÿ<><C3BF><EFBFBD>ƶ<EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ڵ㣬<DAB5><E3A3AC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڻ<EFBFBD><DABB>Ļ<EFBFBD><C4BB><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB>ָ<EFBFBD><D6B8>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD>ٴ<EFBFBD><D9B4><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڶ<EFBFBD><DAB6><EFBFBD>ָ<EFBFBD>룬<EFBFBD><EBA3AC>֮<EFBFBD><D6AE><EFBFBD><EFBFBD><F2B2BBB4>ڻ<EFBFBD><DABB><EFBFBD>
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD>磺`head = [1,2,3,4,5]`<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
```c
|
||||
p1<EFBFBD><EFBFBD>1 3 5 2 4 1
|
||||
p2<EFBFBD><EFBFBD>1 2 3 4 5 1
|
||||
```
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD>磺`head = [1,2,3,4]`<EFBFBD><EFBFBD>ż<EFBFBD><EFBFBD>
|
||||
```c
|
||||
p1<EFBFBD><EFBFBD>1 3 1 3 1
|
||||
p2<EFBFBD><EFBFBD>1 2 3 4 1
|
||||
```
|
||||
|
||||
**<EFBFBD>ο<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>**<2A><>
|
||||
|
||||
- ״̬<D7B4><CCAC>ͨ<EFBFBD><CDA8>
|
||||
- ִ<><D6B4><EFBFBD><EFBFBD>ʱ: 112 ms, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 98.43% <20><><EFBFBD>û<EFBFBD>
|
||||
- <20>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD><EFBFBD>: 24.9 MB, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 5.13% <20><><EFBFBD>û<EFBFBD>
|
||||
|
||||
```c
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* public class ListNode {
|
||||
* public int val;
|
||||
* public ListNode next;
|
||||
* public ListNode(int x) {
|
||||
* val = x;
|
||||
* next = null;
|
||||
* }
|
||||
* }
|
||||
*/
|
||||
public class Solution {
|
||||
public bool HasCycle(ListNode head) {
|
||||
ListNode p1 = head;
|
||||
ListNode p2 = head;
|
||||
|
||||
while (p1 != null && p1.next != null)
|
||||
{
|
||||
p1 = p1.next.next;
|
||||
p2 = p2.next;
|
||||
if (p1 == p2)
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
## <20><>Ŀ04<30><34><EFBFBD><EFBFBD>ת<EFBFBD><D7AA><EFBFBD><EFBFBD>
|
||||
|
||||
|
||||
> - <20><><EFBFBD>ţ<EFBFBD>206
|
||||
> - <20>Ѷȣ<D1B6><C8A3><EFBFBD><EFBFBD><EFBFBD>
|
||||
> - https://leetcode-cn.com/problems/reverse-linked-list/
|
||||
|
||||
<EFBFBD><EFBFBD>תһ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
<b>ʾ<><CABE></b>:
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 1->2->3->4->5->NULL
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 5->4->3->2->1->NULL
|
||||
```
|
||||
|
||||
<b><3E><><EFBFBD><EFBFBD></b>:
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ե<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݹ<EFBFBD><EFBFBD>ط<EFBFBD>ת<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ܷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ַ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>⣿
|
||||
|
||||
**˼·**<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˫ָ<CBAB><D6B8><EFBFBD>ķ<EFBFBD>ʽ<EFBFBD><CABD>
|
||||
|
||||
`p1`<EFBFBD><EFBFBD>Ϊǰ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><EFBFBD>̽·<EFBFBD><EFBFBD>`p2`<EFBFBD><EFBFBD>Ϊ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˳<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һȦ<EFBFBD><EFBFBD><EFBFBD>㶨<EFBFBD><EFBFBD><EFBFBD>⡣
|
||||
|
||||
**<EFBFBD>ο<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>**<2A><>
|
||||
|
||||
- ״̬<D7B4><CCAC>ͨ<EFBFBD><CDA8>
|
||||
- ִ<><D6B4><EFBFBD><EFBFBD>ʱ: 116 ms, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 97.50% <20><><EFBFBD>û<EFBFBD>
|
||||
- <20>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD><EFBFBD>: 23.3 MB, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 5.26% <20><><EFBFBD>û<EFBFBD>
|
||||
|
||||
```c
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* public class ListNode {
|
||||
* public int val;
|
||||
* public ListNode next;
|
||||
* public ListNode(int x) { val = x; }
|
||||
* }
|
||||
*/
|
||||
|
||||
public class Solution
|
||||
{
|
||||
public ListNode ReverseList(ListNode head)
|
||||
{
|
||||
if (head == null || head.next == null)
|
||||
return head;
|
||||
|
||||
ListNode p1 = head;
|
||||
ListNode p2 = null;
|
||||
while (p1 != null)
|
||||
{
|
||||
ListNode temp = p1.next;
|
||||
p1.next = p2;
|
||||
p2 = p1;
|
||||
p1 = temp;
|
||||
}
|
||||
return p2;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
---
|
||||
## <20><>Ŀ05<30><35>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>еĽڵ<C4BD>
|
||||
|
||||
> - <20><><EFBFBD>ţ<EFBFBD>237
|
||||
> - <20>Ѷȣ<D1B6><C8A3><EFBFBD><EFBFBD><EFBFBD>
|
||||
> - https://leetcode-cn.com/problems/delete-node-in-a-linked-list/
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>дһ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʹ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD>ij<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>и<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ģ<EFBFBD><EFBFBD><EFBFBD>ĩβ<EFBFBD><EFBFBD><EFBFBD>ڵ㣬<EFBFBD>㽫ֻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҫ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD><EFBFBD>Ľڵ㡣
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> -- head = [4,5,1,9]<5D><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ա<EFBFBD>ʾΪ:
|
||||
|
||||
|
||||
|
||||
|
||||
<b>ʾ<><CABE> 1</b>:
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: head = [4,5,1,9], node = 5
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: [4,1,9]
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵΪ 5 <EFBFBD>ĵڶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ㣬<EFBFBD><EFBFBD>ô<EFBFBD>ڵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĺ<EFBFBD><EFBFBD><EFBFBD>֮<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ӧ<EFBFBD><EFBFBD>Ϊ 4 -> 1 -> 9.
|
||||
```
|
||||
|
||||
<b>ʾ<><CABE> 2</b>:
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: head = [4,5,1,9], node = 1
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: [4,5,9]
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵΪ 1 <EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ㣬<EFBFBD><EFBFBD>ô<EFBFBD>ڵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĺ<EFBFBD><EFBFBD><EFBFBD>֮<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ӧ<EFBFBD><EFBFBD>Ϊ 4 -> 5 -> 9.
|
||||
```
|
||||
|
||||
<b>˵<><CBB5></b>:
|
||||
|
||||
- <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ٰ<EFBFBD><D9B0><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ㡣
|
||||
- <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>нڵ<D0BD><DAB5><EFBFBD>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD>Ψһ<CEA8>ġ<EFBFBD>
|
||||
- <20><><EFBFBD><EFBFBD><EFBFBD>Ľڵ<C4BD>Ϊ<EFBFBD><CEAA>ĩβ<C4A9>ڵ㲢<DAB5><E3B2A2>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>е<EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD>Ч<EFBFBD>ڵ㡣
|
||||
- <20><>Ҫ<EFBFBD><D2AA><EFBFBD><EFBFBD><EFBFBD>ĺ<EFBFBD><C4BA><EFBFBD><EFBFBD>з<EFBFBD><D0B7><EFBFBD><EFBFBD>κν<CEBA><CEBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
|
||||
|
||||
**˼·<EFBFBD><EFBFBD>** <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>û<EFBFBD>и<EFBFBD><D0B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͷ<EFBFBD>ڵ㣬<DAB5><E3A3AC><EFBFBD><EFBFBD>ֱ<EFBFBD>Ӹ<EFBFBD><D3B8><EFBFBD>Ҫɾ<D2AA><C9BE><EFBFBD>Ľڵ㣬<DAB5><E3A3AC><EFBFBD><EFBFBD><EFBFBD>ǽ<EFBFBD><C7BD><EFBFBD>ԭ<EFBFBD><D4AD>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƕ<EFBFBD><C7B6>ڸýڵ<C3BD><DAB5><EFBFBD>ǰһ<C7B0><D2BB><EFBFBD>ڵ<EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD>֪<EFBFBD><D6AA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֱ<EFBFBD><D6B1>ִ<EFBFBD><D6B4>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ˣ<EFBFBD><CBA3><EFBFBD><EFBFBD>ǽ<EFBFBD>Ҫɾ<D2AA><C9BE><EFBFBD>ڵ<EFBFBD><DAB5><EFBFBD> next <20>ڵ<EFBFBD><DAB5><EFBFBD>ֵ<EFBFBD><D6B5>ֵ<EFBFBD><D6B5>Ҫɾ<D2AA><C9BE><EFBFBD>Ľڵ㣬ת<E3A3AC><D7AA>ȥɾ<C8A5><C9BE> next <20>ڵ㣬<DAB5>Ӷ<EFBFBD><D3B6><EFBFBD><EFBFBD><EFBFBD>Ŀ<EFBFBD>ġ<EFBFBD>
|
||||
|
||||
**<EFBFBD>ο<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>**<2A><>
|
||||
|
||||
- ״̬<D7B4><CCAC>ͨ<EFBFBD><CDA8>
|
||||
- 41 / 41 <20><>ͨ<EFBFBD><CDA8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
- ִ<><D6B4><EFBFBD><EFBFBD>ʱ: 120 ms, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 99.55% <20><><EFBFBD>û<EFBFBD>
|
||||
- <20>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD><EFBFBD>: 24.4 MB, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 5.88% <20><><EFBFBD>û<EFBFBD>
|
||||
|
||||
```c
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* public class ListNode {
|
||||
* public int val;
|
||||
* public ListNode next;
|
||||
* public ListNode(int x) { val = x; }
|
||||
* }
|
||||
*/
|
||||
|
||||
public class Solution
|
||||
{
|
||||
public void DeleteNode(ListNode node)
|
||||
{
|
||||
ListNode temp = node.next;
|
||||
while (temp != null)
|
||||
{
|
||||
node.val = temp.val;
|
||||
temp = temp.next;
|
||||
if (temp != null)
|
||||
{
|
||||
node = node.next;
|
||||
}
|
||||
}
|
||||
node.next = null;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
|
||||
|
||||
---
|
||||
## <20><>Ŀ06<30><36><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
> - <20><><EFBFBD>ţ<EFBFBD>2
|
||||
> - <20>Ѷȣ<D1B6><C8A3>е<EFBFBD>
|
||||
> - https://leetcode-cn.com/problems/add-two-numbers/
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <b><3E>ǿ<EFBFBD></b> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD><EFBFBD>Ǹ<EFBFBD><C7B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>У<EFBFBD><D0A3><EFBFBD><EFBFBD>Ǹ<EFBFBD><C7B8>Ե<EFBFBD>λ<EFBFBD><CEBB><EFBFBD>ǰ<EFBFBD><C7B0><EFBFBD> <b><3E><><EFBFBD><EFBFBD></b> <20>ķ<EFBFBD>ʽ<EFBFBD>洢<EFBFBD>ģ<EFBFBD><C4A3><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ǵ<EFBFBD>ÿ<EFBFBD><C3BF><EFBFBD>ڵ<EFBFBD>ֻ<EFBFBD>ܴ洢 <b>һλ</b> <20><><EFBFBD>֡<EFBFBD>
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ǽ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>᷵<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD>µ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʾ<EFBFBD><EFBFBD><EFBFBD>ǵĺ͡<EFBFBD>
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Լ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0 ֮<>⣬<EFBFBD><E2A3AC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 0 <20><>ͷ<EFBFBD><CDB7>
|
||||
|
||||
<b>ʾ<><CABE> 1</b><3E><>
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD>룺(2 -> 4 -> 3) + (5 -> 6 -> 4)
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>7 -> 0 -> 8
|
||||
ԭ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>342 + 465 = 807
|
||||
```
|
||||
|
||||
<b>ʾ<><CABE> 2</b><3E><>
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD>룺(3 -> 7) + (9 -> 2)
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>2 -> 0 -> 1
|
||||
ԭ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>73 + 29 = 102
|
||||
```
|
||||
|
||||
**˼·**<2A><>ģ<EFBFBD><C4A3><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Сѧʱ<D1A7><CAB1>ѧ<EFBFBD>ļӷ<C4BC><D3B7><EFBFBD><EFBFBD>㡣<EFBFBD><E3A1A3>λ<EFBFBD><CEBB><EFBFBD>ӳ<EFBFBD><D3B3><EFBFBD>ʮ<EFBFBD><CAAE>һ<EFBFBD><D2BB>ʮλ<CAAE><CEBB><EFBFBD><EFBFBD><EFBFBD>н<EFBFBD>λ<EFBFBD><CEBB><EFBFBD><EFBFBD><EFBFBD>Ͻ<EFBFBD>λ<EFBFBD><CEBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ơ<EFBFBD>
|
||||
|
||||
<b><3E>ο<EFBFBD><CEBF><EFBFBD><EFBFBD>룺</b>
|
||||
|
||||
- ״̬<D7B4><CCAC>ͨ<EFBFBD><CDA8>
|
||||
- ִ<><D6B4><EFBFBD><EFBFBD>ʱ: 144 ms, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 97.98% <20><><EFBFBD>û<EFBFBD>
|
||||
- <20>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD><EFBFBD>: 26.7 MB, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 5.07% <20><><EFBFBD>û<EFBFBD>
|
||||
|
||||
```c
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* public class ListNode {
|
||||
* public int val;
|
||||
* public ListNode next;
|
||||
* public ListNode(int x) { val = x; }
|
||||
* }
|
||||
*/
|
||||
public class Solution
|
||||
{
|
||||
public ListNode AddTwoNumbers(ListNode l1, ListNode l2)
|
||||
{
|
||||
ListNode result = new ListNode(-1);
|
||||
ListNode l3 = result;
|
||||
int flag = 0;
|
||||
while (l1 != null && l2 != null)
|
||||
{
|
||||
int a = l1.val;
|
||||
int b = l2.val;
|
||||
int c = a + b + flag;
|
||||
l3.next = new ListNode(c%10);
|
||||
|
||||
flag = c >= 10 ? 1 : 0;
|
||||
l1 = l1.next;
|
||||
l2 = l2.next;
|
||||
l3 = l3.next;
|
||||
}
|
||||
|
||||
while (l1 != null)
|
||||
{
|
||||
int a = l1.val + flag;
|
||||
|
||||
l3.next = new ListNode(a%10);
|
||||
|
||||
flag = a >= 10 ? 1 : 0;
|
||||
l1 = l1.next;
|
||||
l3 = l3.next;
|
||||
}
|
||||
|
||||
while (l2 != null)
|
||||
{
|
||||
int b = l2.val + flag;
|
||||
|
||||
l3.next = new ListNode(b%10);
|
||||
flag = b >= 10 ? 1 : 0;
|
||||
l2 = l2.next;
|
||||
l3 = l3.next;
|
||||
}
|
||||
|
||||
if (flag == 1)
|
||||
{
|
||||
l3.next = new ListNode(flag);
|
||||
}
|
||||
return result.next;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
---
|
||||
## <20><>Ŀ07<30><37>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĵ<EFBFBD><C4B5><EFBFBD><EFBFBD><EFBFBD>N<EFBFBD><4E><EFBFBD>ڵ<EFBFBD>
|
||||
|
||||
> - <20><><EFBFBD>ţ<EFBFBD>19
|
||||
> - <20>Ѷȣ<D1B6><C8A3>е<EFBFBD>
|
||||
> - https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>`n`<EFBFBD><EFBFBD><EFBFBD>ڵ㣬<EFBFBD><EFBFBD><EFBFBD>ҷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͷ<EFBFBD><EFBFBD><EFBFBD>㡣
|
||||
|
||||
**ʾ<><CABE>**<EFBFBD><EFBFBD>
|
||||
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 1->2->3->4->5, <EFBFBD><EFBFBD> n = 2.
|
||||
|
||||
<EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD><EFBFBD>˵<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ 1->2->3->5.
|
||||
```
|
||||
|
||||
**˵<EFBFBD><EFBFBD>**<2A><>
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>`n`<EFBFBD><EFBFBD>֤<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ч<EFBFBD>ġ<EFBFBD>
|
||||
|
||||
**<EFBFBD><EFBFBD><EFBFBD><EFBFBD>**<2A><>
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD>ܳ<EFBFBD><EFBFBD><EFBFBD>ʹ<EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD>ɨ<EFBFBD><EFBFBD>ʵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
**˼·<EFBFBD><EFBFBD>** ʹ<><CAB9><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD>룬ǰ<EBA3AC><C7B0><EFBFBD><EFBFBD>ָ<EFBFBD><D6B8>`p1`<EFBFBD><EFBFBD><EFBFBD><EFBFBD>`n`<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ú<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><EFBFBD>`p2`<EFBFBD><EFBFBD>`p1`ͬ<EFBFBD><EFBFBD><EFBFBD>ߣ<EFBFBD>`p1`<EFBFBD>ߵ<EFBFBD><EFBFBD>յ㣬`p2`<EFBFBD><EFBFBD><EFBFBD>ߵ<EFBFBD>Ҫ<EFBFBD>Ƴ<EFBFBD><EFBFBD>Ľ<EFBFBD><EFBFBD><EFBFBD>λ<EFBFBD>á<EFBFBD>
|
||||
|
||||
**<EFBFBD>ο<EFBFBD><EFBFBD><EFBFBD><EFBFBD>룺**
|
||||
- ִ<>н<EFBFBD><D0BD><EFBFBD><EFBFBD><EFBFBD>ͨ<EFBFBD><CDA8>
|
||||
- ִ<><D6B4><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>104 ms, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 86.93% <20><><EFBFBD>û<EFBFBD>
|
||||
- <20>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD>ģ<EFBFBD>24.6 MB, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 100.00% <20><><EFBFBD>û<EFBFBD>
|
||||
|
||||
```c
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* public class ListNode {
|
||||
* public int val;
|
||||
* public ListNode next;
|
||||
* public ListNode(int x) { val = x; }
|
||||
* }
|
||||
*/
|
||||
public class Solution
|
||||
{
|
||||
public ListNode RemoveNthFromEnd(ListNode head, int n)
|
||||
{
|
||||
ListNode p1 = head;
|
||||
ListNode p2 = head;
|
||||
|
||||
while (n > 0)
|
||||
{
|
||||
p1 = p1.next;
|
||||
n--;
|
||||
}
|
||||
|
||||
if (p1 == null) //<2F>Ƴ<EFBFBD>ͷ<EFBFBD><CDB7><EFBFBD><EFBFBD>
|
||||
{
|
||||
return head.next;
|
||||
}
|
||||
|
||||
while (p1.next != null)
|
||||
{
|
||||
p1 = p1.next;
|
||||
p2 = p2.next;
|
||||
}
|
||||
|
||||
p2.next = p2.next.next;
|
||||
return head;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
|
||||
---
|
||||
## <20><>Ŀ08<30><38><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>еĽڵ<C4BD>
|
||||
|
||||
> - <20><><EFBFBD>ţ<EFBFBD>24
|
||||
> - <20>Ѷȣ<D1B6><C8A3>е<EFBFBD>
|
||||
> - https://leetcode-cn.com/problems/swap-nodes-in-pairs/
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵĽڵ㣬<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ؽ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
**<EFBFBD>㲻<EFBFBD><EFBFBD>ֻ<EFBFBD>ǵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĸı<EFBFBD><EFBFBD>ڵ<EFBFBD><EFBFBD>ڲ<EFBFBD><EFBFBD><EFBFBD>ֵ**<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҫʵ<D2AA>ʵĽ<CAB5><C4BD>нڵ㽻<DAB5><E3BDBB><EFBFBD><EFBFBD>
|
||||
|
||||
|
||||
|
||||
**ʾ<><CABE>:**
|
||||
|
||||
> <EFBFBD><EFBFBD><EFBFBD><EFBFBD> 1->2->3->4, <20><>Ӧ<EFBFBD>÷<EFBFBD><C3B7><EFBFBD> 2->1->4->3.
|
||||
|
||||
|
||||
**<EFBFBD>ο<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>**<2A><>
|
||||
|
||||
- ִ<>н<EFBFBD><D0BD><EFBFBD><EFBFBD><EFBFBD>ͨ<EFBFBD><CDA8>
|
||||
- ִ<><D6B4><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>100 ms, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 93.18% <20><><EFBFBD>û<EFBFBD>
|
||||
- <20>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD>ģ<EFBFBD>23.4 MB, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 87.72% <20><><EFBFBD>û<EFBFBD>
|
||||
|
||||
```c
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* public class ListNode {
|
||||
* public int val;
|
||||
* public ListNode next;
|
||||
* public ListNode(int x) { val = x; }
|
||||
* }
|
||||
*/
|
||||
|
||||
public class Solution
|
||||
{
|
||||
public ListNode SwapPairs(ListNode head)
|
||||
{
|
||||
if (head == null || head.next == null)
|
||||
return head;
|
||||
|
||||
head = Swap(head);
|
||||
|
||||
ListNode temp = head.next;
|
||||
|
||||
while (temp != null && temp.next != null)
|
||||
{
|
||||
temp.next = Swap(temp.next);
|
||||
if (temp.next != null)
|
||||
{
|
||||
temp = temp.next.next;
|
||||
}
|
||||
}
|
||||
return head;
|
||||
}
|
||||
|
||||
public ListNode Swap(ListNode node)
|
||||
{
|
||||
if (node == null || node.next == null)
|
||||
return node;
|
||||
|
||||
ListNode t = node.next;
|
||||
node.next = t.next;
|
||||
t.next = node;
|
||||
return t;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
---
|
||||
## <20><>Ŀ09<30><39><EFBFBD><EFBFBD>ת<EFBFBD><D7AA><EFBFBD><EFBFBD>
|
||||
|
||||
|
||||
> - <20><><EFBFBD>ţ<EFBFBD>61
|
||||
> - <20>Ѷȣ<D1B6><C8A3>е<EFBFBD>
|
||||
> - https://leetcode-cn.com/problems/rotate-list/
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ת<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ÿ<EFBFBD><EFBFBD><EFBFBD>ڵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƶ<EFBFBD> k <20><>λ<EFBFBD>ã<EFBFBD><C3A3><EFBFBD><EFBFBD><EFBFBD> k <20>ǷǸ<C7B7><C7B8><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
**ʾ<><CABE> 1:**
|
||||
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 1->2->3->4->5->NULL, k = 2
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 4->5->1->2->3->NULL
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>:
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ת 1 <EFBFBD><EFBFBD>: 5->1->2->3->4->NULL
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ת 2 <EFBFBD><EFBFBD>: 4->5->1->2->3->NULL
|
||||
```
|
||||
|
||||
**ʾ<><CABE> 2:**
|
||||
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 0->1->2->NULL, k = 4
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 2->0->1->NULL
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>:
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ת 1 <EFBFBD><EFBFBD>: 2->0->1->NULL
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ת 2 <EFBFBD><EFBFBD>: 1->2->0->NULL
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ת 3 <EFBFBD><EFBFBD>: 0->1->2->NULL
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ת 4 <EFBFBD><EFBFBD>: 2->0->1->NULL
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
||||
**<EFBFBD>ο<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>**<2A><>
|
||||
|
||||
- ִ<>н<EFBFBD><D0BD><EFBFBD><EFBFBD><EFBFBD>ͨ<EFBFBD><CDA8>
|
||||
- ִ<><D6B4><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>100 ms, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 98.13% <20><><EFBFBD>û<EFBFBD>
|
||||
- <20>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD>ģ<EFBFBD>25.1 MB, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 100.00% <20><><EFBFBD>û<EFBFBD>
|
||||
|
||||
|
||||
```c
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* public class ListNode {
|
||||
* public int val;
|
||||
* public ListNode next;
|
||||
* public ListNode(int x) { val = x; }
|
||||
* }
|
||||
*/
|
||||
|
||||
public class Solution
|
||||
{
|
||||
public ListNode RotateRight(ListNode head, int k)
|
||||
{
|
||||
if (head == null || k == 0)
|
||||
return head;
|
||||
|
||||
int len = GetLength(head);
|
||||
int index = len - k%len;
|
||||
|
||||
if (index == len)
|
||||
return head;
|
||||
|
||||
ListNode temp1 = head;
|
||||
ListNode temp2 = head;
|
||||
for (int i = 0; i < index - 1; i++)
|
||||
{
|
||||
temp1 = temp1.next;
|
||||
}
|
||||
head = temp1.next;
|
||||
temp1.next = null;
|
||||
|
||||
temp1 = head;
|
||||
while (temp1.next != null)
|
||||
{
|
||||
temp1 = temp1.next;
|
||||
}
|
||||
temp1.next = temp2;
|
||||
return head;
|
||||
}
|
||||
|
||||
public int GetLength(ListNode head)
|
||||
{
|
||||
ListNode temp = head;
|
||||
int i = 0;
|
||||
while (temp != null)
|
||||
{
|
||||
i++;
|
||||
temp = temp.next;
|
||||
}
|
||||
return i;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
|
||||
|
||||
---
|
||||
## <20><>Ŀ10<31><30><EFBFBD>ϲ<EFBFBD>K<EFBFBD><4B><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
> - <20><><EFBFBD>ţ<EFBFBD>23
|
||||
> - <20>Ѷȣ<D1B6><C8A3><EFBFBD><EFBFBD><EFBFBD>
|
||||
> - https://leetcode-cn.com/problems/merge-k-sorted-lists/
|
||||
|
||||
|
||||
<EFBFBD>ϲ<EFBFBD> k <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>غϲ<D8BA><CFB2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>㷨<EFBFBD>ĸ<EFBFBD><C4B8>Ӷȡ<D3B6>
|
||||
|
||||
<b>ʾ<><CABE></b>:
|
||||
```c
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>:
|
||||
[
|
||||
1->4->5,
|
||||
1->3->4,
|
||||
2->6
|
||||
]
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>: 1->1->2->3->4->4->5->6
|
||||
```
|
||||
|
||||
<b>˼·<CBBC><C2B7></b><3E><><EFBFBD><EFBFBD><EFBFBD>ϲ<EFBFBD><CFB2>ķ<EFBFBD>ʽ<EFBFBD><CABD>
|
||||
|
||||
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ϲ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>õ<EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD>µ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ķ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>`ListNode MergeTwoLists(ListNode l1, ListNode l2)`<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʹ<EFBFBD>ø÷<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ϲ<EFBFBD>ǰ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>õ<EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD>µ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>֮<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ϲ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>õ<EFBFBD><EFBFBD>ϲ<EFBFBD>`K`<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>б<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>б<EFBFBD><EFBFBD><EFBFBD>
|
||||
|
||||
|
||||
**<EFBFBD>ο<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>**<2A><>
|
||||
|
||||
- ִ<>н<EFBFBD><D0BD><EFBFBD><EFBFBD><EFBFBD>ͨ<EFBFBD><CDA8>
|
||||
- ִ<><D6B4><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>256 ms, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 36.69% <20><><EFBFBD>û<EFBFBD>
|
||||
- <20>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD>ģ<EFBFBD>29.3 MB, <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> C# <20>ύ<EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD> 18.37% <20><><EFBFBD>û<EFBFBD>
|
||||
|
||||
|
||||
```c
|
||||
/**
|
||||
* Definition for singly-linked list.
|
||||
* public class ListNode {
|
||||
* public int val;
|
||||
* public ListNode next;
|
||||
* public ListNode(int x) { val = x; }
|
||||
* }
|
||||
*/
|
||||
public class Solution
|
||||
{
|
||||
public ListNode MergeTwoLists(ListNode l1, ListNode l2)
|
||||
{
|
||||
ListNode pHead = new ListNode(int.MaxValue);
|
||||
ListNode temp = pHead;
|
||||
|
||||
while (l1 != null && l2 != null)
|
||||
{
|
||||
if (l1.val < l2.val)
|
||||
{
|
||||
temp.next = l1;
|
||||
l1 = l1.next;
|
||||
}
|
||||
else
|
||||
{
|
||||
temp.next = l2;
|
||||
l2 = l2.next;
|
||||
}
|
||||
temp = temp.next;
|
||||
}
|
||||
|
||||
if (l1 != null)
|
||||
temp.next = l1;
|
||||
|
||||
if (l2 != null)
|
||||
temp.next = l2;
|
||||
|
||||
return pHead.next;
|
||||
}
|
||||
|
||||
public ListNode MergeKLists(ListNode[] lists) {
|
||||
if (lists.Length == 0)
|
||||
return null;
|
||||
|
||||
ListNode result = lists[0];
|
||||
for (int i = 1; i < lists.Length; i++)
|
||||
{
|
||||
result = MergeTwoLists(result, lists[i]);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user