非常简单
非常简单,上链接:
https://leetcode-cn.com/problems/reverse-linked-list/
/**
* 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 reverseList(ListNode head) {
ListNode prev = null;
ListNode cur = head;
while(cur != null){
ListNode next= cur.next;
cur.next = prev;
prev = cur;
cur = next;
}
return prev;
}
}
就是设置一个next节点储存cur.next,这样cur.next指向prev时,cur仍然可以向右移。