0208面试题环路检测
02.08面试题 环路检测下面是题目
这题和141.环形链表相近，但是需要考虑更多有俩个指针 fast ,slow分别的从起点a 开始走，slow走一步，fast走里俩步。如果过程中 快fast走到null,说明不存在环。否则fast和slow一定会相遇，相遇后，slow待在原地不动，将 fast放
...
1019链表中的下一个更大元素
Posted on
Words count in article:
472
|
Reading time ≈
2
1019.链表中的下一个更大元素下面是题目下面是题目给出的模板1234567891011121314/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *nex
...
143重排链表
Posted on
Words count in article:
759
|
Reading time ≈
3
143.重排列表下面是题目
下面是题目给出的模板12345678910111213/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; *
...
1171从链表中删除总和值为0的连续节点
Posted on
Words count in article:
867
|
Reading time ≈
3
1171. 从链表中删去总和值为零的连续节点下面是题目,需要注意的是，题目说的是总和为0的连续结点下面是题目给出的模板1234567891011121314/** * Definition for singly-linked list. * struct ListNode { *
...
82删除排序链表中的重复元素2
Posted on
Words count in article:
680
|
Reading time ≈
3
82. 删除排序链表中的重复元素 II下面是题目
下面是题目给出的模板1234567891011121314/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode
...
92反转链表
Posted on
Words count in article:
631
|
Reading time ≈
2
92. 反转链表 II下面是题目
下面是题目给出的代码模板1234567891011121314/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next;
...
61旋转链表
Posted on
Words count in article:
372
|
Reading time ≈
1
61.旋转链表下面是题目
下面是题目给出的模板1234567891011121314/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; *
...
148链表排序
Posted on
Words count in article:
224
|
Reading time ≈
1
148. 排序链表下面是题目下面是题目给出的代码模板1234567891011121314/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; *
...
147链表插入排序
Posted on
Words count in article:
261
|
Reading time ≈
1
147.链表插入排序下面是题目下面是题目给出的模板1234567891011121314/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; *
...
86分割链表表_大小分隔
Posted on
Words count in article:
499
|
Reading time ≈
2
86.大小分隔下面是题目
下面是题目给出的模板1234567891011121314/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; *
...