数据结构-链表

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


//链表结点的定义
typedef struct Node{
    int data;
    struct Node *next;
}Node;

//创建链表
Node* create() {
    //创建一个具有头结点的链表
    Node* p = (Node*) malloc(sizeof(Node));
    Node *temp = p;
    cout << "请输入数据个数：";
    int n;
    cin >> n;
    cout << "请输入数据：";
    for(int i=0; i<n; i++) {
        Node* node = (Node*) malloc(sizeof(Node));
        cin >> node->data;
        node->next = NULL;

        temp->next = node;
        temp = temp->next;
    }
    return p;
}
//遍历链表
void traverse(Node *p) {
    cout << "链表中：";
    Node* temp = p;
    //排除头结点的影响
    while (temp->next) {
        temp = temp->next;
        cout << temp->data;
        if(temp->next) {
            cout << "->";
        }
    }
    cout << "\n";
}
//查找结点
int find(Node* p, int num) {
    Node* temp = p;
    int i = 1;
    while (temp->next) {
        temp = temp->next;
        if(temp->data == num) {
            break;
        }
        i++;
    }
    return i;
}
//插入到尾部结点
Node* insert(Node* p, int data) {
    Node* temp = p;
    while (temp->next) {
        temp = temp->next;
    }
    Node* node = (Node*) malloc(sizeof (Node));
    node->data = data;
    node->next = NULL;
    temp->next = node;

    cout << "链表插入成功！" << endl;
    traverse(p);
    return p;
}
//插入到中间结点
Node* insertMiddle(Node* p, int data, int add) {
    Node* temp = p;
    for(int i=0; i<add-1; i++) {
        temp = temp->next;
    }
    Node* node = (Node*) malloc(sizeof(Node));
    node->data = data;
    node->next = temp->next;
    temp->next = node;
    cout << "插入成功！" << endl;
    traverse(p);
    return p;
}
//删除结点
Node* deleteNode(Node* p,int data) {
    Node* temp = p;
    Node* t = NULL;
    while(temp->next) {
        if(temp->next->data == data) {
            break;
        }
        temp = temp->next;
    }
    t = temp->next;
    temp->next = temp->next->next;
    delete(t);
    cout << "此数删除成功！" << endl;
    traverse(p);
    return temp;
}

int main(){
    Node* p = NULL;
    int num, addr;
    p = create();
    traverse(p);
    cout << "请输入您要查找的数：";
    cin >> num;
    int i = find(p, num);
    if(i != 0) {
        cout << "您要查找的元素位置在第 ";
        cout << i;
    } else {
        cout << "您要查找的元素不存在！";
    }
    cout << endl;

    cout << "请输入您要尾部插入的数：";
    cin >> num;
    insert(p, num);
    cout << endl;

    cout << "请输入您要中间部分插入的数及地址：";
    cin >> num >> addr;
    insertMiddle(p, num, addr);
    cout << endl;

    cout << "请输入您要删除的数：";
    cin >> num;
    deleteNode(p,num);
    return 0;
}