61. Rotate List

Rotate List

反转列表

代码

public class Solution {    public ListNode rotateRight(ListNode head, int k) {        if(head == null || k == 0){            return head;        }        ListNode p = head;        int len =1;        while(p.next != null){            p = p.next;            len++;        }        p.next = head;        k %= len;        for(int i = 0; i < (len-k); i++){            p = p.next;        }        head = p.next;        p.next = null;        return head;    }}