题目描述
AC代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode reverseList(ListNode head) {
if(head==null)
return head;
ListNode a=head;
ListNode b=a.next;
while(b!=null){
ListNode c=b.next;
b.next=a;
a=b;
b=c;
}
head.next=null;
head=a;
return head;
}
}