【leetcode】Reverse Linked List II
来源:互联网 发布:科凌a8蓝牙淘宝 编辑:程序博客网 时间:2024/05/16 09:29
Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,
return 1->4->3->2->5->NULL.
Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
思路:
找到n和m两个点,然后再一对对地交换其val.
class Solution {public: ListNode* reverseBetween(ListNode* head, int m, int n) { ListNode *p,*q,*re,*ne; p=head; for(int i=1;i<m;i++) //注意从1开始,因为之前已经指向了head,少了一个点。 { p=p->next; } for(int i=m;i<n;i++) { q=p; for(int j=i;j<n;j++) q=q->next; swap(p->val,q->val); n--; p=p->next; } return head; }};
0 0
- LeetCode[Linked List]: Reverse Linked List II
- LeetCode: Reverse Linked List II
- LeetCode: Reverse Linked List II
- [LeetCode] Reverse Linked List II
- [Leetcode] Reverse Linked List II
- [LeetCode]Reverse Linked List II
- Leetcode: Reverse Linked List II
- [Leetcode]Reverse Linked List II
- [leetcode]Reverse Linked List II
- LeetCode-Reverse Linked List II
- LeetCode Reverse Linked List II
- [leetcode] Reverse Linked List II
- LeetCode - Reverse Linked List II
- [LeetCode] Reverse Linked List II
- LeetCode | Reverse Linked List II
- 【leetcode】Reverse Linked List II
- Leetcode: Reverse Linked List II
- leetcode Reverse Linked List II
- hdu 5228 ZCC loves straight flush
- dubbo 的使用
- 设计模式之 - 适配器模式
- tq335x开发板的spidev驱动的生成
- java.lang.NullPointerException at org.hibernate.tuple.AbstractEntityTuplizer.createProxy(AbstractEn
- 【leetcode】Reverse Linked List II
- 三层
- TCP,HTTP和SOCKET基本原理
- C语言new操作的安全性分析
- 句柄和指针的区别
- 静态方法在高并发情况下对性能的影响
- 有禾教育辑狗,挑战最强大脑,助力思维发展!
- erlang 代码反编译
- 对于io流的使用