一、题目描述
翻转链表
Example 1:
Input: 1->2->3->4->5->NULL, k = 2 Output: 4->5->1->2->3->NULL Explanation: rotate 1 steps to the right: 5->1->2->3->4->NULL rotate 2 steps to the right: 4->5->1->2->3->NULL
Example 2:
Input: 0->1->2->NULL, k = 4
Output: 2->0->1->NULL
二、思路
1.先求链表的长度n
2.对于example2,k=4和k=1的效果一样,这里巧妙利用k=k%n
3.然后设两个指针完成翻转
三、C代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* rotateRight(struct ListNode* head, int k){
if (!head || k == 0) return head;
struct ListNode *p1 = head;
int n = 1;
while(p1->next)
{
p1 = p1->next;
n++;
}
k %= n;
if(k == 0) return head;
k = n - k;
p1->next = head;
struct ListNode *p2 = head;
for(int i = 0; i < k - 1; i++)
{
p2 = p2->next;
}
head = p2->next;
p2->next = NULL;
return head;
}