leetcode61. 旋转链表

给定一个链表，旋转链表，将链表每个节点向右移动 k 个位置，其中 k 是非负数。

示例 1:
输入: 1->2->3->4->5->NULL, k = 2
输出: 4->5->1->2->3->NULL
解释:
向右旋转 1 步: 5->1->2->3->4->NULL
向右旋转 2 步: 4->5->1->2->3->NULL
示例 2:
输入: 0->1->2->NULL, k = 4
输出: 2->0->1->NULL
解释:
向右旋转 1 步: 2->0->1->NULL
向右旋转 2 步: 1->2->0->NULL
向右旋转 3 步: 0->1->2->NULL
向右旋转 4 步: 2->0->1->NULL

先求链表长，然后找到切的位置，然后前后换位就好：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def rotateRight(self, head, k):
        """
        :type head: ListNode
        :type k: int
        :rtype: ListNode
        """
        if not head or not head.next:
            return head
        len_listnode, node = 0, head
        while node:
            len_listnode += 1
            node = node.next
        cut_length = len_listnode - (k%len_listnode)
        if cut_length == 0 or cut_length == len_listnode:
            return head
        node = head
        for i in range(cut_length-1):
            node = node.next
        tmp = node.next
        node.next = None
        after = tmp
        while after.next:
            after = after.next
        after.next = head
        return tmp

把链表连成环了再找位置切开即可：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def rotateRight(self, head, k):
        """
        :type head: ListNode
        :type k: int
        :rtype: ListNode
        """
        if not head or not head.next:
            return head
        len_listnode, node = 1, head
        while node.next:
            len_listnode += 1
            node = node.next
        node.next = head  # 先连成环,然后再切
        for i in range(len_listnode-k%len_listnode):
            node = node.next
        res = node.next
        node.next = None
        return res