LeetCode-----反转链表

• 题目

输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）

• 解法

---

·1.垃圾解法：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
        vector<int> rever_vec;
        while(head!=NULL)
        {
             int temp = head->val;
             head = head->next;
             rever_vec.push_back(temp);
        }
        vector<int> ff;
        for(int i = rever_vec.size()-1; i>=0; i--)
        {
            ff.push_back(rever_vec[i]);
        }
        return ff;
    }
};

2.好的解法：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> reversePrint(ListNode* head) {
        vector<int> rever_vec;
        while(head!=NULL)
        {
             int temp = head->val;
             head = head->next;
             rever_vec.push_back(temp);
        }
        reverse(rever_vec.begin(),rever_vec.end());
        return rever_vec;
    }
};

运行结果：