/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* reverseList(struct ListNode* head) {
if(head==NULL)
return NULL;
struct ListNode* Pre=NULL;
struct ListNode* pNode=head;
while(pNode!=NULL){
struct ListNode* pNext=pNode->next;
pNode->next=Pre;
Pre=pNode;
pNode=pNext;
}
return Pre;
}
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* reverseList(struct ListNode* head) {
if(head==NULL)
return NULL;
struct ListNode* Pre=NULL;
struct ListNode* pNode=head;
while(pNode!=NULL){
struct ListNode* pNext=pNode->next;
pNode->next=Pre;
Pre=pNode;
pNode=pNext;
}
return Pre;
}