# Question

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


# Solution

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

class Solution:
"""
:type k: int
:rtype: ListNode
"""
if k == 0:

idx = 0
while idx < k and end is not None:
prev = end
end = end.next
idx += 1

if idx < k:
length = idx
k = k % length
if k == 0:

idx = 0
while idx < k and end is not None:
prev = end
end = end.next
idx += 1

if idx == k and end is None:

while end is not None:
prev = end
end = end.next