LeetCode in Java [4]: 61. Rotate List

最新推荐文章于 2021-02-22 00:22:50 发布

クロネコ黒猫

最新推荐文章于 2021-02-22 00:22:50 发布

阅读量67

点赞数

分类专栏： LeetCode Java 文章标签： lcjava

本文链接：https://blog.csdn.net/cyr429/article/details/103585884

版权

LeetCode Java 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Example 1:

Input: 1->2->3->4->5->NULL, k = 2
Output: 4->5->1->2->3->NULL
Explanation:
rotate 1 steps to the right: 5->1->2->3->4->NULL
rotate 2 steps to the right: 4->5->1->2->3->NULL

Example 2:

Input: 0->1->2->NULL, k = 4
Output: 2->0->1->NULL
Explanation:
rotate 1 steps to the right: 2->0->1->NULL
rotate 2 steps to the right: 1->2->0->NULL
rotate 3 steps to the right: 0->1->2->NULL
rotate 4 steps to the right: 2->0->1->NULL

Success

Runtime: 0 ms, faster than 100.00% of Java online submissions for Rotate List.

Memory Usage: 38 MB, less than 70.69% of Java online submissions for Rotate List.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode rotateRight(ListNode head, int k) {
        if(head==null||k==0){return head;}
        int num=0;
        ListNode tail=head;
        for(ListNode temp=head;temp!=null;temp=temp.next){
            tail=temp;
            num++;
        }
        k=k%num;
        ListNode newtail=head;
        for(int i=0;i<num-k-1;i++){
            newtail=newtail.next;
        }
        tail.next=head;
        head=newtail.next;
        newtail.next=null;
        return head;
    }
}