题解 | 链表序列化

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 *	ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 
     * @return int整型vector
     */
    vector<int> listnodeToVector(ListNode* head) {
        vector<int> res;
        while(head != nullptr){
            int num = head->val;
            res.push_back(num);
            head = head->next;
        }
        return res;
    }
};