一个简单的不带头节点链表

最新推荐文章于 2024-04-27 08:00:00 发布

YinJianxiang

最新推荐文章于 2024-04-27 08:00:00 发布

阅读量591

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/YinJianxiang/article/details/55050901

版权

数据结构专栏收录该内容

11 篇文章 1 订阅

订阅专栏

pointlink.h

#ifndef _POINTLINK_H_
#define _POINTLINK_H_

#include<stdio.h>
#include<malloc.h>
#include<conio.h>

typedef struct POINT{
	int row;
	int col;
	struct POINT *next;
}POINT;

void initPointLink(POINT **h);
void showPoints(POINT *h);
void showPoint(POINT point);
void destoryPointLink(POINT **h);
#endif

pointlink.c

#include"pointlink.h"
void destoryPointLink(POINT **h){
	POINT *p;

	while(*h){
		p = *h;
		*h = p->next;
		free(p);
	}
}
void showPoint(POINT point){
	printf("(%d, %d)\n",point.col,point.row);
}
void showPoints(POINT *h){
	if(h){
		for( ;h;h = h->next)
			showPoint(*h);
	}else{
		printf("无数据");
	}
}
void initPointLink(POINT **h){
	POINT *p;
	POINT *q;
	int row;
	int col;

	if(*h){
		printf("链表已经初始化，不能再次初始化");
	}else{
		printf("请输入坐标\n");
		scanf("%d%d",&row,&col);

		while(row && col){
			p = (POINT *)malloc(sizeof(POINT));
			p->row = row;
			p->col = col;
			p->next = NULL;
			if(*h = NULL)
				*h = p;
			else
				q->next = p;
			q = p;
			printf("请输入坐标\n");
			scanf("%d%d",&row,&col);
		}
	}
}