本文共 1059 字,大约阅读时间需要 3 分钟。
给定一个链表,旋转链表,将链表每个节点向右移动 k 个位置,其中 k 是非负数。
示例 1:输入: 1->2->3->4->5->NULL, k = 2输出: 4->5->1->2->3->NULL解释:向右旋转 1 步: 5->1->2->3->4->NULL向右旋转 2 步: 4->5->1->2->3->NULL示例 2:输入: 0->1->2->NULL, k = 4输出: 2->0->1->NULL解释:向右旋转 1 步: 2->0->1->NULL向右旋转 2 步: 1->2->0->NULL向右旋转 3 步: 0->1->2->NULL向右旋转 4 步: 2->0->1->NULL
# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def rotateRight(self, head: ListNode, k: int) -> ListNode: if head == None: return head tail = head count = 1 while tail.next != None: tail = tail.next count += 1 tail.next = head k = k % count fast = head low = head for i in range(k + 1): fast = fast.next while fast != tail: fast = fast.next low = low.next low = low.next head = low.next low.next = None return head
转载地址:http://vyoxi.baihongyu.com/