PTA头插法创建单链表、遍历链表、删除链表

题目如下，代码亲测能过

#include <iostream>
#include <list>

int main() {
    int k;
    std::cin >> k;

    for (int i = 0; i < k; ++i) {
        std::list<int> linkedList;
        int num;
        while (1) {
            std::cin >> num;
            if (num == -1) {
                break;
            }
            linkedList.push_front(num);
        }

        for (int value : linkedList) {
            std::cout << value << " ";
        }
        std::cout << std::endl;
    }

    return 0;
}