用c++编程实现链表逆序

struct ListNode{ int val; struct ListNode *next; }; struct ListNode* reverse(struct ListNode* head) { struct ListNode* new_head = NULL, *tmpNode; while(head) { tmpNode = head->next; head->next = new_head; new_head = head; head = tmpNode; } return new_head; }

递归和非递归实现，这应该算找工作出的题目里的送分题了吧。

用栈不就好了吗

剑指offer