题目:
Reverse a singly linked list.
解答:
关键是弄明白next到底指向哪个元素;
代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode reverseList(ListNode head) {
if(head == null || head.next == null)
return head;
ListNode last, cur,next;
last = head;
cur = head.next;
last.next = null;
while(cur != null){
next = cur.next;
cur.next = last;
last = cur;
cur = next;
}
return last;
}
}