데이터 구조 상의: 실험 1 - 선형 표 기본 조작 과 간단 한 프로그램

#include 
using namespace std;
struct node {
    int data;
    node *next;
};

node *LinkedListInit() {
    node *L;
    L = new node;
    if(L == NULL) {
        printf("        
");
    }
    L->next = NULL;
 	return L;
}

node *LinkedListCreatH() {
    node *L;
    L = new node;
    L->next = NULL;
    int x;
    while(scanf("%d",&x) != EOF) {
        node *p;
        p=new node;
        p->data = x;
        p->next = L->next;
        L->next = p;
    }
    return L;
}

node *LinkedListInsert(node *L,int i,int x) {
    node *pre;
    pre = L;
    int tempi = 0;
    for (tempi = 1; tempi < i; tempi++) {
    	pre = pre->next;
	}
    node *p;
    p = new node;
    p->data = x;
    p->next = pre->next;
    pre->next = p;

    return L;
}

node *LinkedListDelete(node *L,int x)
{
    node *p,*pre;
    p = L->next;
    while(p->data != x) {
        pre = p;
        p = p->next;
    }
    if(x==L->next->data){
        L->next=L->next->next;
    }
    else{
        pre->next = p->next;
    }
    return L;
}

int main() {
    node *list,*start;
 	printf("         ：");
    list = LinkedListCreatH();
    for(start = list->next; start != NULL; start = start->next) {
    	printf("%d ",start->data);
	}
    printf("
");
    int i;
    int x;
    printf("
");
    printf("           ：");
    scanf("%d",&x);
    LinkedListDelete(list,x);
    for(start = list->next; start != NULL; start = start->next) {
    	printf("%d ",start->data);
	}
    printf("
");

    return 0;
}