leetcode——92——Reverse Linked List II
2016-04-30 17:41
417 查看
Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given
return
Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.
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) {} * }; */ class Solution { public: ListNode* reverseBetween(ListNode* head, int m, int n) { if(head == NULL) return head; ListNode *newhead = new ListNode(-1); newhead->next = head; ListNode *prebegin = newhead; ListNode *begin = head; ListNode *end = newhead; ListNode *postend = head; while(--m) { prebegin = prebegin->next; begin = begin->next; } while(n--) { end = end->next; postend = postend->next; } //reverse reverse(begin, end); //link prebegin->next = begin; end->next = postend; return newhead->next; } void reverse(ListNode*& begin, ListNode*& end) { if(begin == end) return; else if(begin->next == end) end->next = begin; else {//at least 3 nodes ListNode* pre = begin; ListNode* cur = pre->next; ListNode* post = cur->next; while(post != end->next) { cur->next = pre; pre = cur; cur = post; post = post->next; } cur->next = pre; } //swap ListNode* temp = begin; begin = end; end = temp; } };
相关文章推荐
- Spring中的AOP(六)——基于XML配置文件方式的AOP
- 大数整除(大数mod)
- ORA-01501: CREATE DATABASE failed
- VMWare10安装Centos6.5 32位网络配置问题
- 打字测试
- java 利用for循环打印九九乘法口诀
- XMG 导航控制器push的时候下一个控制器的时候view的加载
- Spring中的AOP(五)——定义切入点和切入点指示符
- Spring中的AOP(四)——在Advice方法中获取目标方法的参数
- Jquery中事件的绑定和解除
- 解决Centos关闭You have new mail in /var/spool/mail/root提示
- 传输层协议TCP和UDP
- Spring中的AOP(三)——基于Annotation的配置方式(二)
- Spring中的AOP(二)——基于Annotation的配置方式(一)
- 《选择排序之后位之争》
- Linux iostat监测IO状态
- 调整链表顺序使奇数位于偶数前面
- Spring中的AOP(一)——AOP基本概念和Spring对AOP的支持
- NBUT 1462 台球碰撞(物理运动)
- jQuery中this与$(this)的区别