链表基础

链表的定义、创建、遍历

#include <iostream>

using namespace std;

// 定义
struct ListNode
{
    int val{};
    ListNode* next;
    explicit ListNode(int x = 0) : val(x), next(nullptr) {}
    explicit ListNode(ListNode* next) : val(0), next(next) {}
    ListNode(int x, ListNode* next) : val(x), next(next) {}
};

// 创建
ListNode* cinListNode(int n)
{
    auto* head = new ListNode();
    ListNode* p = head;

    cin >> head->val;

    for (int i = 1; i < n; i++)
    {
        int num;
        cin >> num;
        p->next = new ListNode(num);
        p = p->next;
    }

    return head;
}

// 遍历输出
inline void coutListNode(ListNode* p)
{
    for (; p != nullptr; p = p->next)
    {
        cout << p->val << " ";
    }

    cout << "\b\n";
}