struct node 
{ 
  int num; 
  struct node *p; 
} ; 

#include <stdlib.h> /*含ma l l o c ( ) 的頭文件*/ 
#include <stdio.h> 
 //①定義鏈表數(shù)據(jù)結(jié)構(gòu) 
struct node 
{ 
  int num; 
  struct node *next; 
}; 
//函數(shù)聲明 
struct node *creat();  
void print(); 
main( ) 
{ 
 
  struct node *head; 
  head=NULL;  //②建一個空表 
  head=creat(head);/*創(chuàng)建單鏈表*/ 
  print(head);/*打印單鏈表*/ 
} 
/******************************************/  
struct node*creat(struct node *head)/*返回的是與節(jié)點(diǎn)相同類型的指針*/ 
{ 
  struct node*p1,*p2; 
  int i=1; 
//③利用malloc ( )函數(shù)向系統(tǒng)申請分配一個節(jié)點(diǎn) 
  p1=p2=(struct node*)malloc(sizeof(struct node));/*新節(jié)點(diǎn)*/  
  printf("請輸入值，值小于等于0結(jié)束，值存放地址為：p1_ADDR= %d\n",p1); 
  scanf("%d",&p1->num);/*輸入節(jié)點(diǎn)的值*/ 
  p1->next=NULL;/*將新節(jié)點(diǎn)的指針置為空*/ 
  while(p1->num>0)/*輸入節(jié)點(diǎn)的數(shù)值大于0*/ 
  { 
//④將新節(jié)點(diǎn)的指針成員賦值為空。若是空表，將新節(jié)點(diǎn)連接到表頭；若是非空表，將新節(jié)點(diǎn)接到表尾;  
    if(head==NULL) 
      head=p1;/*空表，接入表頭*/ 
    else  
      p2->next=p1;/*非空表，接到表尾*/ 
    p2=p1; 
 
    p1=(struct node*)malloc(sizeof(struct node));/*下一個新節(jié)點(diǎn)*/ 
    i=i+1; 
    printf("請輸入值，值小于等于0結(jié)束，值存放地址為：p%d_ADDR= %d\n",i,p2); 
    scanf("%d",&p1->num);/*輸入節(jié)點(diǎn)的值*/ 
//⑤判斷一下是否有后續(xù)節(jié)點(diǎn)要接入鏈表，若有轉(zhuǎn)到3 )，否則結(jié)束;  
  } 
//==============原來程序更正部分：（多謝@daling_datou提醒）================================ 
  free(p1); //申請到的沒錄入，所以釋放掉  
  p1=NULL;  //使指向空  
  p2->next = NULL; //到表尾了，指向空  
  printf("鏈表輸入結(jié)束（END）\n");  
//============================================== 
  return head;/*返回鏈表的頭指針*/ 
} 
/*******************************************/ 
void print(struct node*head)/*出以head為頭的鏈表各節(jié)點(diǎn)的值*/ 
{ 
  struct node *temp; 
  temp=head;/*取得鏈表的頭指針*/ 
 
  printf("\n\n\n鏈表存入的值為：\n"); 
  while(temp!=NULL)/*只要是非空表*/ 
  { 
    printf("%6d\n",temp->num);/*輸出鏈表節(jié)點(diǎn)的值*/ 
    temp=temp->next;/*跟蹤鏈表增長*/ 
  } 
  printf("鏈表打印結(jié)束!!"); 
} 

#include <stdio.h> 
#include <malloc.h> 
#define LEN sizeof(NODE) 
 
typedef struct _NODE//節(jié)點(diǎn)聲明 
{ 
  int val; 
  struct _NODE* next; 
} NODE, *PNODE; 
 
void print(PNODE head){//打印所有節(jié)點(diǎn) 
  while (head) 
  { 
    printf("%3d",head->val); 
    head = head->next; 
  } 
  printf("\n"); 
} 
 
void insertHead(PNODE *pHead, int val){//頭插法 
  PNODE n = (PNODE)malloc(LEN); 
  n->val = val; 
  n->next = *pHead; 
  *pHead = n; 
} 
 
void insertTail(PNODE *pHead, int val){//尾插法 
  PNODE t = *pHead; 
  PNODE n = (PNODE)malloc(LEN); 
  n->val = val; 
  n->next = NULL; 
  if (*pHead == NULL) 
  { 
    n->next = *pHead; 
    *pHead = n; 
  }else{ 
    while (t->next) 
    { 
      t = t->next; 
    } 
    t->next = n; 
  } 
} 
 
void deleteHead(PNODE *pHead){//刪除頭 
  if (*pHead == NULL) 
  { 
    return; 
  } 
  else 
  { 
    PNODE t = *pHead; 
    *pHead = (*pHead)->next; 
    free(t); 
  } 
} 
 
void deleteTail(PNODE *pHead){//刪除尾 
  PNODE t = *pHead; 
  if (t == NULL) 
  { 
    return; 
  } 
  else if (t->next == NULL) 
  { 
    free(t); 
    *pHead = NULL; 
  } 
  else{     
    while (t->next->next != NULL) 
    { 
      t = t->next; 
    } 
    free(t->next); 
    t->next = NULL; 
  } 
} 
 
PNODE findByVal(PNODE head, int val){//根據(jù)值找到滿足條件的第一個節(jié)點(diǎn) 
  while (head != NULL && head->val != val) 
  { 
    head = head->next; 
  } 
  return head; 
} 
 
PNODE findByIndex(PNODE head, int index){//根據(jù)索引找節(jié)點(diǎn) 
  if (index == 1) 
  { 
    return head; 
  } 
  else 
  { 
    int c = 1; 
    while (head != NULL && index != c) 
    { 
      head = head->next; 
      c++; 
    } 
  } 
  return head; 
} 
 
void insertByIndex(PNODE *pHead, int index, int val){//根據(jù)索引插入節(jié)點(diǎn) 
  if (index == 1) 
  { 
    insertHead(pHead, val); 
  } 
  else 
  { 
    PNODE t = findByIndex(*pHead,index - 1); 
    if (t == NULL) 
    { 
      return; 
    } 
    else 
    { 
      PNODE n = t->next; 
      t->next = (PNODE)malloc(LEN); 
      t->next->next = n; 
      t->next->val = val; 
    } 
  } 
} 
 
void deleteByIndex(PNODE *pHead, int index)//根據(jù)結(jié)點(diǎn)索引刪除結(jié)點(diǎn) 
{ 
  if (index == 1) 
  { 
    deleteHead(pHead); 
  } 
  else 
  { 
    PNODE t= findByIndex(*pHead, index - 1); 
    if (t == NULL || t->next == NULL) 
    { 
      return; 
    }else{ 
      PNODE n = t->next->next; 
      free(t->next); 
      t->next = n; 
    } 
  } 
} 
 
void deleteByVal(PNODE *pHead, int val)//根據(jù)值刪掉第一個滿足條件的 
{ 
  if (*pHead == NULL)//如果空表退出 
  { 
    return; 
  } 
  else 
  { 
    if ((*pHead)->val == val)//如果第一個就是，刪頭 
    { 
      deleteHead(pHead); 
    } 
    else 
    { 
      PNODE t = *pHead; 
      while (t->next != NULL && t->next->val != val)//遍歷，若t的next為空或者next是要找的節(jié)點(diǎn)則退出 
      { 
        t = t->next; 
      } 
      if (t->next)//如果t指向要找的結(jié)點(diǎn)的上一個節(jié)點(diǎn) 
      { 
        PNODE n = t->next->next;//刪除要找的結(jié)點(diǎn) 
        free(t->next); 
        t->next = n; 
      } 
    } 
  } 
} 
 
void clear(PNODE *pHead)//清除鏈表 
{ 
  while ((*pHead) != NULL) 
  { 
    deleteHead(pHead);//從頭刪除 
  } 
} 
 
void main() 
{ 
  PNODE head = NULL; 
 
  insertTail(&head,1); 
  deleteHead(&head); 
  insertTail(&head,2); 
  insertTail(&head,3); 
  insertTail(&head,4); 
  insertTail(&head,5); 
  insertTail(&head,6); 
 
  print(head); 
  insertByIndex(&head, 6, 9); 
  print(head); 
  //deleteByIndex(&head,3); 
  deleteByVal(&head, 2); 
  print(head); 
  clear(&head); 
  print(head); 
  insertByIndex(&head,1,12); 
  print(head); 
}