【数据结构 链表】

当调用一个新的指针时～必须要 new 不然会产生意想不到的错误 -～-

AC代码：

#include<iostream>
using namespace std;
typedef struct node{
    int data;
    struct node *next;
}*n;
int InitList_L(n &L){
     L = new node;
     L -> next = NULL;
     return 1;
}
int CreateList_L(n &L){
    node *p,*q = L;
    for(int i = 1; i <= 10; i++){
        p = new node;
        cin >> p -> data;
        q -> next = p;
        p -> next = NULL;
        q = q -> next;
    }
    return 1;
}
int GetElem_L(n &L,int a,int &res){
     int nl = 0;
     node *p = L -> next;
     while(++nl != a && p) p = p -> next;
     if(nl != a) return 0;
     res = p -> data;
     return 1;
}
int LocateElem_L(n &L,int b,int &c){
      node *p = L -> next;
      int nl = 1;
      while(p -> data != b && p) p = p -> next,nl++;
      if(p -> data != b)