LeetCode-61. Rotate List

https://leetcode.com/problems/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.

Solution

# 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 not head or not head.next or k == 0:
            return head
        tail = head
        n = 1
        while tail.next:
            tail = tail.next
            n += 1
            
        k = k%n
        slow = head
        fast = head
        newHead = ListNode(None)
        for i in range(k):
            fast = fast.next
        while fast.next:
            slow = slow.next
            fast = fast.next
        fast.next = head
        newHead.next = slow.next
        slow.next = None
        return newHead.next

转载于:https://www.cnblogs.com/binwone/p/6086072.html