Leetcode 61 旋转链表

最新推荐文章于 2023-10-29 18:56:09 发布

一杯小熊

最新推荐文章于 2023-10-29 18:56:09 发布

阅读量71

点赞数

分类专栏： LeetCode 链表

本文链接：https://blog.csdn.net/sinat_40469883/article/details/118056633

版权

链表环形链表右旋数据结构算法

关键词由CSDN通过智能技术生成

LeetCode 同时被 2 个专栏收录

32 篇文章 0 订阅

订阅专栏

链表

10 篇文章 0 订阅

订阅专栏

思路：先连成环再截断

代码：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def rotateRight(self, head: ListNode, k: int) -> ListNode:
        if not head or not head.next: return head
        n = 1
        cur = head
        while cur and cur.next:
            cur = cur.next
            n += 1
        k = k % n
        if k == 0: return head
        cur.next = head
        q = n - k
        cur = head
        i = 0
        while cur and i < q - 1:
            cur = cur.next
            i += 1
        new_head = cur.next
        cur.next = None
        return new_head
        '''
        if not head: return head
        n = 0
        cur = head
        while cur:
            cur = cur.next
            n += 1
        k = k % n
        if k == 0: return head
        q = n - k
        cur = head
        i = 0
        while cur and i < q - 1:
            cur = cur.next
            i += 1
        new_head = cur.next
        cur.next = None
        cur = new_head
        while cur and cur.next:
            cur = cur.next
        cur.next = head
        return new_head
        '''