Rotate List

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.

---

class Solution {
public:
    int ListSize ( ListNode* head ) // 单链表的长度

    // 指向第k-1个元素
    ListNode* pntBK ( ListNode* head, int k ) {
        ListNode* ptr = head;
        for ( int i = 0; i < k - 1; ++i ) {
            ptr = ptr->next;
        }
        return ptr;
    }

    ListNode *rotateRight (ListNode *head, int k) {
        if ( head == NULL ) { return NULL; }
        int len = ListSize ( head );

        /*
        ** 本题目的关键，对k >= head.size 的处理。 {1}，k = 99
        */
        k = len - ( k % len );
        if ( k == 0 || k == len ) {
            return head;
        }

        ListNode* phead = head, *ptr_k = pntBK ( phead, k );
        ListNode* nhead = ptr_k->next;  // 新的头指针

        // 断成两段
        ptr_k->next = NULL;

        // 第二段尾链接第一段
        ListNode* end = pntK( nhead, len - k );
        end->next = phead;

        return ( head = nhead );
    }
};