标签：Node List length next 链表 tail link 数据结构

单链表

#include <iostream>
using namespace std;
typedef int dt;

struct Node {
    Node* link;
    dt data;
    Node(Node* ptr = NULL) { link = ptr; }
    Node(const dt& item, Node* ptr = NULL) { data = item, link = ptr; }
};
class List {
public:
    List() { first = new Node; }//默认构造函数
    List(const dt& x) { first = new Node(x); }
    List(const List& ln);//拷贝构造函数
    ~List() { makeEmpty(); };//析构函数
    void makeEmpty();
    bool Insert(int, dt&);//向链表第i个位置添加数据
    bool Remove(int i, dt& x);//移除某个结点
    bool isEmpty()const { return first->link == NULL ? 1 : 0; }//判断是否为空
    int size()const { return length; }//链表长度
    void show();//显示链表
    Node* getHead()const { return first; }
    Node* Search(dt);//查找结点
    Node* Locate(int)const;//定位
    bool getDate(int i, dt& x)const;//获取数据
    void setDate(int i, dt& x);//设置数据
    void output();
    void Create(int n);
protected:
    Node* first;
    int length;
};
//拷贝构造函数

List::List(const List& ln) {
    dt value;
    Node* srcptr = ln.getHead();
    Node* destptr = first = new Node;
    while (srcptr->link) {
        value = srcptr->link->data;
        destptr->link = new Node(value);
        destptr = destptr->link;
        srcptr = srcptr->link;
        length++;
    }
    destptr->link = NULL;
}
//置空

void List::makeEmpty() {
    Node* q;
    while (first->link) {
        q = first->link;
        first->link = q->link;
        delete q;
    }
}
//查询

Node* List::Search(dt x) {
    Node* p = first->link;
    while (p) {
        if (p->data == x)break;
        else p = p->link;
    }
    return p;
}
///定位

Node* List::Locate(int i) const{
    Node* p = first->link;
    if (i < 0)return NULL;
    int k = 0;
    while (p && k < i) {
        p = p->link;
        k++;
    }
    return p;
}
//获取数据

bool List::getDate(int i, dt& x)const {
    if (i < 0)return NULL;
    Node* p = Locate(i);
    if (p == NULL)return 0;
    else { x = p->data; return 1; }
}
//设置数据

void List::setDate(int i, dt& x) {
    if (i <= 0)return;
    Node* p = Locate(i);
    if (p == NULL)return ;
    else  p->data = x;
}
//插入

bool List::Insert(int i, dt& x) {
    if (first == NULL || i == 0) {
        Node* newnode = new Node(x);
        if (newnode == NULL) { cerr << "存储分配错误！" << endl; exit(1); }
        newnode->link = first;
        first = newnode;
    }
    else {
        Node* p = Locate(i - 1);
        if (p == NULL)return 0;
        Node* newnode = new Node(x);
        if (newnode == NULL) { cerr << "存储分配错误！" << endl; exit(1); }
        newnode->link = p->link;
        p->link = newnode;
    }
    length++;
    return 1;
}

bool List::Remove(int i, dt& x) {
    Node* p = Locate(i - 1);
    if (p == NULL || p->link == NULL)return 0;
    Node* del = p->link;
    p->link = del->link;
    x = del->data; delete del; length--; return 1;
}

void List::output() {
    Node* p = first->link;
    while (p) {
        cout << p->data << " ";
        p = p->link;
    }
    cout << endl;
}

void List::Create(int n)
{
    if (n < 0) {
        printf("error\n");
        return;
    }
    Node* ptemp = NULL;
    Node* pnew = NULL;

    this->length = n;
    ptemp = this->first;
    for (int i = 0; i < n; i++) {
        pnew = new Node;
        pnew->link = NULL;
        cout << "输入第" << i + 1 << "个节点值" << endl;
        dt x;
        cin >> x;
        pnew->data = x;
        ptemp->link = pnew;
        ptemp = pnew;
    }
    cout << "创建完成" << endl;
    return;
}

int main() {
    List ls1;
    ls1.Create(5);
    ls1.output();
    cout << ls1.size() << endl;
    int n;
    cin >> n;
    for (int i = 1; i < n; i++) {
        int a;
        cin >> a;
        ls1.Insert(i, a);
    }
    ls1.output();
    cout << ls1.size() << endl;
}

循环链表

#include <iostream>
using namespace std;

template <class T>
class Node{
public:
    Node<T>* next;
    Node<T>* prev;
    T data;
};
template <class T>
class List{
public:
    List();//默认构造函数
    List(const List& ln);//拷贝构造函数
    ~List();//析构函数
    void add(T e);//向链表添加数据
    void ascSort();//升序排序
    void remove(T index);//移除某个结点
    T find(int index);//查找结点
    bool isEmpty();//判断是否为空
    int size();//链表长度
    void show();//显示链表
    void resShow();//链表反向显示
    void removeAll();//删除全部结点
private:
    Node<T>* head;
    Node<T>* tail;
    int length;
};
//
//默认构造函数
template <typename T>
List<T>::List(){
    head = new Node<T>;
    tail = new Node<T>;
    head->next = tail;
    head->prev = nullptr;
    tail->next = nullptr;
    tail->prev = head;
    length = 0;
}
//拷贝构造函数
template <typename T>
List<T>::List(const List& ln){
    head = new Node<T>;
    head->prev = nullptr;
    tail = new Node<T>;
    head->next = tail;
    tail->prev = head;
    length = 0;
    Node<T>* temp = ln.head;
    while (temp->next != ln.tail){
        temp = temp->next;
        tail->data = temp->data;
        Node<T>* p = new Node<T>;
        p->prev = tail;
        tail->next = p;
        tail = p;
        length++;
    }
    tail->next = nullptr;
}
//向链表添加数据
template <typename T>
void List<T>::add(T e){
    Node<T>* temp = this->tail;
    tail->data = e;
    tail->next = new Node<T>;
    Node<T>* p = tail;
    tail = tail->next;
    tail->prev = p;
    tail->next = nullptr;
    length++;
}
//查找结点
template <typename T>
T List<T>::find(int index){
    if (length == 0){
        std::cout << "List is empty";
        return NULL;
    }
    if (index >= length){
        std::cout << "Out of bounds";
        return NULL;
    }
    int x = 0;
    T data;
    Node<T>* p;
    if (index < length / 2){
        p = head->next;
        while (p->next != nullptr && x++ != index){
            p = p->next;
        }
    }
    else {
        p = tail->prev;
        while (p->prev != nullptr && x++ != index){
            p = p->prev;
        }
    }
    return p->data;
}
//删除结点
template <typename T>
void List<T>::remove(T index){
    if (length == 0){
        std::cout << "List is empty";
        return;
    }
    Node<T>* p = head;
    while (p->next != nullptr){
        p = p->next;
        if (p->data == index){
            Node<T>* temp = p->prev;
            temp->next = p->next;
            p->next->prev = temp;
            delete p;
            length--;
            return;
        }
    }
}
//删除所有结点
template <typename T>
void List<T>::removeAll(){
    if (length == 0){
        return;
    }
    Node<T>* p = head->next;
    while (p != tail){
        Node<T>* temp = p;
        p = p->next;
        delete temp; 
    }
    head->next = tail;
    tail->prev = head;
    length = 0;
}
//升序排序
template <typename T>
void List<T>::ascSort(){
    if (length <= 1) return;
    Node<T>* p = head->next;
    for (int i = 0; i < length - 1; i++){
        Node<T>* q = p->next;
        for (int j = i + 1; j < length; j++){
            if (p->data > q->data){
                T temp = q->data;
                q->data = p->data;
                p->data = temp;
            }
            q = q->next;
        }
        p = p->next;
    }
}
//判断是否为空
template <typename T>
bool List<T>::isEmpty(){
        return length == 0 ? true : false; 
}
//链表长度
template <typename T>
int List<T>::size(){
    return length;
}
//输出链表
template <typename T>
void List<T>::show(){
    if (length == 0){
        std::cout << "List is empty" << std::endl;
        return;
    }
    Node<T>* p = head->next;
    while (p != tail){
        std::cout << p->data << " ";
        p = p->next;
    }
    std::cout << std::endl;
}
//反向输出链表
template <typename T>
void List<T>::resShow(){
    if (length == 0)return;
    Node<T>* p = tail->prev;
    while (p != head){
        std::cout << p->data << " ";
        p = p->prev;
    }
    std::cout << std::endl;
}
//析构函数
template <typename T>
List<T>::~List(){
    if (length == 0){
        delete head;
        delete tail;
        head = nullptr;
        tail = nullptr;
        return;
    }
    while (head->next != nullptr){
        Node<T>* temp = head;
        head = head->next;
        delete temp;
    }
    delete head;
    head = nullptr;
}
int main(){
    List<float> ls1;
    ls1.add(1.1);
    ls1.add(0.1);
    ls1.add(6);
    ls1.add(3.3);
    List<float> ls2(ls1);
    ls2.resShow();
    std::cout << ls2.size() << std::endl;
    std::cout << ls2.find(00) << std::endl;
    ls2.remove(6);
    ls1.resShow();
    ls2.show();
    system("pause");
    return 0;
}

标签：Node,List,length,next,链表,tail,link,数据结构
来源： https://blog.csdn.net/github_50047554/article/details/113776142

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。