给出一个链表1->2->3->null,这个翻转后的链表为3->2->1->null
public:
/**
* @param head: The first node of linked list.
* @return: The new head of reversed linked list.
*/
ListNode *reverse(ListNode *head) {
// write your code here
ListNode*p;
p=NULL;
while(head!=0) {
ListNode *aaa;
aaa=head->next;
head->next=p;
p=head;
head=aaa;
}
return p;
}
};
解题思路及感想:一开始把p标记为head,所以一直超出内存。