/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* a =NULL;//设置一个空的结点NULL
ListNode* b=head;
while(b!=NULL){
ListNode* c = b->next;//反转过去之后就找不到后继了,所以要把后继存下来
b->next=a;
a=b;
b=c;
}
return a;
}
};