library

This documentation is automatically generated by online-judge-tools/verification-helper

---

Project maintained by tko919 Hosted on GitHub Pages — Theme by mattgraham

Linked List
(DataStructure/linkedlist.hpp)

• View this file on GitHub
• Last update: 2024-06-22 00:56:30+09:00
• Include: #include "DataStructure/linkedlist.hpp"

Required by

• Bipolar Orientation (Graph/bipolar.hpp)

Code

#pragma once

template<typename T>struct LinkedList{
    struct Node{
        T val;
        Node* head,*tail;
        Node(){}
        Node(T v):val(v),head(nullptr),tail(nullptr){}
    };
    Node* front;
    LinkedList():front(nullptr){}
    Node* insert_back(Node* v,T x){
        if(v==nullptr){
            return front=new Node(x);
        }
        auto to=v->tail;
        auto add=new Node(x);
        v->tail=add;
        add->head=v;
        add->tail=to;
        if(to)to->head=add;
        return add;
    }
    Node* insert_front(Node* v,T x){
        if(v==nullptr){
            return front=new Node(x);
        }
        auto to=v->head;
        auto add=new Node(x);
        if(to)to->tail=add;
        add->head=to;
        add->tail=v;
        v->head=add;
        return add;
    }
    vector<T> dump(){
        vector<T> ret;
        Node* cur=front;
        while(cur){
            ret.push_back(cur->val);
            cur=cur->tail;
        }
        return ret;
    }
};  

/**
 * @brief Linked List
 */

#line 2 "DataStructure/linkedlist.hpp"

template<typename T>struct LinkedList{
    struct Node{
        T val;
        Node* head,*tail;
        Node(){}
        Node(T v):val(v),head(nullptr),tail(nullptr){}
    };
    Node* front;
    LinkedList():front(nullptr){}
    Node* insert_back(Node* v,T x){
        if(v==nullptr){
            return front=new Node(x);
        }
        auto to=v->tail;
        auto add=new Node(x);
        v->tail=add;
        add->head=v;
        add->tail=to;
        if(to)to->head=add;
        return add;
    }
    Node* insert_front(Node* v,T x){
        if(v==nullptr){
            return front=new Node(x);
        }
        auto to=v->head;
        auto add=new Node(x);
        if(to)to->tail=add;
        add->head=to;
        add->tail=v;
        v->head=add;
        return add;
    }
    vector<T> dump(){
        vector<T> ret;
        Node* cur=front;
        while(cur){
            ret.push_back(cur->val);
            cur=cur->tail;
        }
        return ret;
    }
};  

/**
 * @brief Linked List
 */

Back to top page