输入一个链表,从尾到头打印链表每个节点的值。
- vector<int> print(ListNode* head) //递归
- {
- vector<int> v;
-
- if(head != NULL)
- {
- if(head->next != NULL)
- {
- v =print(head->next);
- }
- v.push_back(head->val);
- }
- return v;
- }
- vector<int> print(ListNode* head) //非递归
- {
- vector<int> v;
-
- while(head != NULL)
- {
- v.insert(v.begin(), head->val);
- head = head->next;
- }
- return v;
- }
========================================
- void Reverse(LinkList &L)
- {
- Lnode *p, *q;
- p = L->next;
- L->next = NULL;
- while(p!=NULL)
- {
- q = p;
- p= p->next;
- p->next = L->next;
- L->next = q;
- }
- }
-