leetcode 之Rotate List（18）

这题我的第一想法是用头插法，但实际上并不好做，因为每次都需要遍历最后一个。更简单的做法是将其连成环，找到相应的位置重新设头结点和尾结点。这过

有很多细节需要注意，比如K有可能是大于链表长度的，如何重新设置K等都要注意。

 ListNode *rotateList(ListNode *head, int k){if (head == nullptr || k == 0)return head;ListNode *p = head;int n = 1;while (p->next){n++;p = p->next;}k =n - k%n;//k有可能大于np->next = head;for (int i = 0; i < k; i++)p = p->next;head = p->next;p->next = nullptr;return head;}

View Code

转载于:https://www.cnblogs.com/573177885qq/p/5508473.html

leetcode 之Rotate List（18）相关推荐

[勇者闯LeetCode] 189. Rotate Array
[勇者闯LeetCode] 189. Rotate Array Description Rotate an array of n elements to the right by k steps. F ...
leetcode 61 Rotate List ----- java
Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given ...
[LeetCode 题解]: Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given ...
leetcode 796. Rotate String | 796. 旋转字符串（KMP）
题目 https://leetcode.com/problems/rotate-string/ 题解左神讲的 KMP class Solution {public boolean rotateStr ...
leetcode 396. Rotate Function | 396. 旋转函数（错位相减）
题目 https://leetcode.com/problems/rotate-function/ 题解参考了评论区 O(n)错位相减的题解. class Solution {public int ...
Java for LeetCode 061 Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given ...
LeetCode之Rotate Array
1.题目 Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the a ...
LeetCode 61. Rotate List
题目: Given a list, rotate the list to the right by k places, where k is non-negative. For example: Gi ...
LeetCode 189. Rotate Array
题目: Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the ar ...

leetcode 之Rotate List（18）

leetcode 之Rotate List（18）相关推荐

最新文章

热门文章