Leetcode/1-100q/61.py at master · Garvit244/Leetcode · GitHub

Name: Leetcode/1-100q/61.py at master · Garvit244/Leetcode · GitHub
Rating: 4.7 (6403 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None

classSolution(object):
defrotateRight(self, head, k):
"""
 :type head: ListNode
 :type k: int
 :rtype: ListNode
 """
ifk==0:
returnhead
ifnothead:
returnNone

tempHead, length=head, 1
whiletempHead.next:
length+=1
tempHead=tempHead.next

tempHead.next=head
jump= (length-k)%length

previous=tempHead
whilejump>0:
previous=previous.next
jump-=1
head=previous.next
previous.next=None

returnhead