[Leetcode]@python 61. Rotate List

题目链接：https://leetcode.com/problems/rotate-list/

---

 题目大意：链表向右旋转K位

---

 解题思路：链表操作，注意的是k有可能比链表长度要长，要将k mod 链表的长度

---

 代码（python）：

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

class Solution(object):
    def rotateRight(self, head, k):
        """
        :type head: ListNode
        :type k: int
        :rtype: ListNode
        """

        if k == 0 or head==None:
            return head

        node = ListNode(0)
        node.next = head

        t = node
        size = 0
        while t.next:
            t = t.next
            size += 1

        t.next = node.next

        for i in range(size-(k%size)):
            t = t.next
        head = t.next
        t.next = None
        return head

---