平时会有提问,也是个总结点吧
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode * front = NULL, * cur = head, * ncur = NULL;
while(cur)
{
ncur = cur->next;
cur->next = front;
front = cur;
cur = ncur;
}
return front;
}
};