Leetcode 61. Rotate List(旋转链表) -- c语言

61. Rotate List

Given a linked list, rotate the list to the right by k places, where k is non-negative.

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
Explanation:
rotate 1 steps to the right: 2->0->1->NULL
rotate 2 steps to the right: 1->2->0->NULL
rotate 3 steps to the right: 0->1->2->NULL
rotate 4 steps to the right: 2->0->1->NULL

解题思路：

将单链表首位相连，同时计算结点个数n。当前指针p指向首结点head的前驱结点，向右移动k个位置即是p向前移动n-(k%n)次，此时p指向待返回节点的前驱节点。然后head重新指向待返回结点，并断开环形链表使之成为单链表。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* rotateRight(struct ListNode* head, int k){

    if( head == NULL){
        //链表为空时直接返回
        return NULL;
    }
    struct ListNode *p = head;
    
    //统计链表个数
    int n = 1;
    while(p->next != NULL){
        n++;
        p = p->next;
    }
    //将链表首位相连形成环形链表
    p->next = head;
    
    //m记录p指针需要向前移动的次数，此时p结点指向待返回结点的前驱结点
    int m = n-(k%n);
    for(int i = 0;i < m;i++){
        p = p->next;
    }
    //head重新指向待返回结点
    head = p->next;
    //断开链表，重新形成单链表
    p->next = NULL;
    
    return head;
}

后记：