//按位查找
LNode * GetElem(LinkList L, int i) {
	if (i < 0) return false;

	LNode *p;		//指針p指向當(dāng)前掃描到的結(jié)點(diǎn)
	int j = 0;		//當(dāng)前p指向的是第幾個(gè)結(jié)點(diǎn)
	p = L;			//L指向頭結(jié)點(diǎn)，頭結(jié)點(diǎn)是第 0 個(gè)結(jié)點(diǎn)

	//循環(huán)找到第 i-1 個(gè)結(jié)點(diǎn)
	while (p != NULL && j < i) {
		p = p->next;
		j++;
	}
	return p;
}

//按值查找
LNode * LocateElem(LinkList L, ElemType e) {
    LNode *p = L->next;
    //從第1個(gè)結(jié)點(diǎn)開始查找數(shù)據(jù)域?yàn)閑的結(jié)點(diǎn)
    while (p && p->data != e) {
        p = p->next;
    }
    return p;

//尾插法建立單鏈表
LinkList List_TailInsert(LinkList &L) {
    int x;        //假設(shè)ElemType為整型        
    L = (LinkList)malloc(sizeof(LNode));    //建立頭結(jié)點(diǎn)
    LNode *s, *r = L;        //r為表尾指針
    scanf("%d", &x);        //輸入結(jié)點(diǎn)的值
    while (x != 9999) {        //輸入9999表示結(jié)束
        s = (LNode *)malloc(sizeof(LNode));
        s->data = x;
        r->next = s;
        r = s;                //r指向新的表尾結(jié)點(diǎn)
        scanf("%d", &x);
    }
    r->next = NULL;        //尾結(jié)點(diǎn)指針置空
    return L;
}

//頭插法建立單鏈表
LinkList List_HeadInsert(LinkList &L) {
    LNode *s;
    int x;        //假設(shè)ElemType為整型        
    L = (LinkList)malloc(sizeof(LNode));    //建立頭結(jié)點(diǎn)
    L->next = NULL;
    scanf("%d", &x);        //輸入結(jié)點(diǎn)的值
    while (x != 9999) {        //輸入9999表示結(jié)束
        s = (LNode *)malloc(sizeof(LNode));
        s->data = x;
        s->next = L->next;
        L->next = s;
        scanf("%d", &x);
    }
    return L;
}