# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def rotateRight(self, head: ListNode, k: int) -> ListNode:
if not head:
return None
if not head.next:
return head
pointer1=head
n=1
while pointer1.next:
pointer1=pointer1.next
n+=1
pointer1.next=head
pointer2=head
for i in range(n-k%n-1):
pointer2=pointer2.next
result=pointer2.next
pointer2.next=None
return result
腾讯精选21--python
最新推荐文章于 2024-04-12 17:35:17 发布