demo9.2链表和数组区别及实现.c

#include <stdio.h>
//数组：地址是连续的 不易增删 不灵活
//链表：不连续 灵活 
struct Test
{
     int data;
     struct Test *pnext;

};

int main()
{
  int arry[3]={1,2,3};
  int i;
  int len = sizeof(arry)/sizeof(arry[0]);
  for(i=0;i<len;i++){
   printf("%d ",arry[i]);

   }
   putchar('\n');
  
  //创建3个结构体并把他们组成一个链表
  struct Test t1 ={1,NULL};
  struct Test t2 ={2,NULL};
  struct Test t3 ={3,NULL};
  t1.pnext = &t2;
  t2.pnext = &t3;

  printf("use t1 to print three nums\n");
  printf("%d %d %d",t1.data,t1.pnext->data,t1.pnext->pnext->data);
   

return 0;
}