C语言链表【带源程序，可直接运行】2020-11-25

1，静态链表

#include <stdio.h>

struct LinkNode
{
  int data;
  struct LinkNode *next;

};
void test()
{
    struct LinkNode node1 = {10,NULL};
    struct LinkNode node2 = {20,NULL};
    struct LinkNode node3 = {30,NULL};
    struct LinkNode node4 = {40,NULL};
    struct LinkNode node5 = {50,NULL};
    struct LinkNode node6 = {60,NULL};
    
    node1.next=&node2;
    node2.next=&node3;
    node3.next=&node4;
    node4.next=&node5;
    node5.next=&node6;
    
    //如何遍历链表
    //先定义一个辅助指针变量
    struct LinkNode *pCurrent=&node1;
    while(pCurrent != NULL)
    {
        printf("%d \n",pCurrent->data);
        
        pCurrent=pCurrent->next;//将后继的地址赋值给当前地址
    }
}



int main ()
{
  printf ("Hello World\n");
  test();
  return 0;
}

1.1、运行结果

2、动态链表的插入。本质就是双指针地址的操作