题目链接:. - 力扣(LeetCode)
做链表题总给我一种刷数学题的感觉,并且目前思维一直停留在转换上,这道题就很好地体现出来了,找到旋转后的数字与原来的数字顺序,找规律。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode rotateRight(ListNode head, int k) {
ListNode dummy=new ListNode(0);
ListNode cur=dummy;
if (head==null){
return dummy.next;
}
List<Integer> list=new ArrayList<>();
while (head!=null){
list.add(head.val);
head=head.next;
}
int count=k%list.size();
List<Integer> res=new ArrayList<>();
for (int i = 0; i < list.size(); i++) {
if (i<count){
res.add(list.get(list.size()-count+i));
}else{
res.add(list.get(i-count));
}
}
for (Integer index : res) {
ListNode node=new ListNode(index);
cur.next=node;
cur=cur.next;
}
return dummy.next;
}
}