[LeetCode] 092: Rotate List
来源:互联网 发布:怎么上淘宝的每日好店 编辑:程序博客网 时间:2024/06/07 07:09
[Problem]
[Solution]
Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->5->NULL
and k = 2
,
return 4->5->1->2->3->NULL
.
[Solution]
class Solution {说明:版权所有,转载请注明出处。Coder007的博客
public:
ListNode *rotateRight(ListNode *head, int k) {
// Note: The Solution object is instantiated only once and is reused by each test case.
// invalid
if(NULL == head || k <= 0)return head;
// get the length of the list
int len = 0;
ListNode* p = head;
while(p != NULL){
len++;
p = p->next;
}
// reset k
k %= len;
if(k == 0)return head;
// move k steps forward
p = head;
for(int i = 0; i < k; ++i){
p = p->next;
}
// cut the list into two parts, and link then reversed
ListNode *prep = p;// the node before p;
ListNode *q = head;// the node two be cut
ListNode *preq = q;// the node before q;
while(p != NULL){
preq = q;
q = q->next;
prep = p;
p = p->next;
}
// link
preq->next = NULL;
prep->next = head;
head = q;
return head;
}
};
阅读全文
0 0
- [LeetCode] 092: Rotate List
- [leetcode][list] Rotate List
- LeetCode: Rotate List
- LeetCode Rotate List
- LeetCode : Rotate List
- [Leetcode] Rotate List
- [LeetCode] Rotate List
- [leetcode] Rotate List
- leetcode 70: Rotate List
- [Leetcode] Rotate List
- 【leetcode】Rotate List
- [LeetCode]Rotate List
- [leetcode]Rotate List
- LeetCode-Rotate List
- [leetcode] Rotate List
- LeetCode - Rotate List
- LeetCode:Rotate List
- LeetCode 61: Rotate List
- [LeetCode] 088: Reverse Linked List II
- 排序算法学习笔记
- [LeetCode] 089: Reverse Noes in k-Group
- [LeetCode] 090: Roman to Integer
- [LeetCode] 091: Rotate Image
- [LeetCode] 092: Rotate List
- 国外物联网平台初探(二) ——微软Azure IoT
- [LeetCode] 093: Same Tree
- 【转】SpringMVC 和 Struts2 区别
- [LeetCode] 094: Scramble String
- 9.9训练日志
- [LeetCode] 095: Search a 2D Matrix
- CodeVS1228 苹果树【DFS序】【树状数组】
- [LeetCode] 096: Search for a Range