Linked List->single linked list

最新推荐文章于 2024-09-08 15:12:28 发布

zhoutonglx

最新推荐文章于 2024-09-08 15:12:28 发布

阅读量365

点赞数

CC 4.0 BY-SA版权

分类专栏： algorithm

本文链接：https://blog.youkuaiyun.com/zhoutonglx/article/details/52082090

algorithm 专栏收录该内容

14 篇文章

订阅专栏

本文介绍了一个简单的单链表数据结构实现，包括插入头部、插入尾部、搜索、删除头部和删除尾部等基本操作，并通过示例展示了这些功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<bits/stdc++.h>
using namespace std;

typedef struct List{
    int value;
    List* next;
}*Link;
Link head = NULL;
Link tail = NULL;

void InsertHead(int value){
    Link tmp = new List;
    tmp->value = value;
    tmp->next = head;
    head = tmp;
    if(NULL==tail){
        tail = head;
    }
}

void InsertTail(int value){
    Link tmp = new List;
    tmp->value = value;
    tmp->next = NULL;
    if(NULL==tail){
        tail = tmp;
        head = tmp;
    }else{
        tail->next = tmp;
        tail = tmp;
    }
}

int Search(int value){
    Link p = head;
    int index = 0;
    while(p){
        if(p->value==value){
            return index;
        }
        p = p->next;
        index++;
    }
    return -1;
}

void RemoveHead(){
    if(NULL==head){
        return ;
    }
    Link tmp = head;
    head = head->next;
    delete tmp;
    return  ;
}

void RemoveTail(){
    if(NULL==head){
        return;
    }
    Link prev = NULL;
    Link tmp;
    if(NULL==head->next){
        prev = head;    
        head = tail = NULL;
        delete prev;
        return ;
    }
    prev = head;
    tmp = prev->next;
    while(tmp->next!=NULL){
        prev = tmp;
        tmp = tmp->next;
    }
    prev->next = NULL;
    tail = prev;
    delete tmp;
    return; 
}

void print(){
    Link p = head;
    while(p){
        cout<<p->value<<' ';
        p = p->next;
    }
    cout<<endl;
}

int main(){

    InsertHead(5);
    print();
    InsertTail(8);
    cout<<Search(8)<<endl;
    print();
    RemoveHead();
    print();
}