dulinklist.cpp

串及矩阵的压缩存储应用,二叉树的构造与遍历,栈的测试和应用,线性表的链存储操作实现 源码加报告

#include "stdio.h"
#include "stdlib.h"

#define OVERFLOW 0
#define OK       1
#define TRUE     1
#define ERROR    0

typedef  int ElemType;
typedef  int Status;

typedef struct DuLNode{
	ElemType data;
	struct DuLNode * prior;
	struct DuLNode * next;
}DuLNode,* DuLinkList;

Status Init_DuLinkList(DuLinkList &H)   
{
	H=(DuLNode *)malloc(sizeof(DuLNode));
	if(!H)
		return OVERFLOW;
	H->data=100;
	H->prior=H;
	H->next=H;
	return OK;
}

void Input(DuLinkList &H,int n)
{
	DuLNode *t;
	if(H->next=H)
		t=H;
	else
	{
		t=H->next;
		while(t->next!=H)
			t=t->next;
	}
	for(int i=0;i<n;i++)               
	{
		DuLNode *p=0;
		p=(DuLNode *)malloc(sizeof(DuLNode));
		printf("Input:");  scanf("%d",&(p->data));
		t->next=p;
		H->prior=p;  
		p->prior=t;
		p->next=H; 
		t=t->next;
	}
}
void Print(DuLinkList H)
{
	DuLNode *p;
    p=H->next;
	while(p!=H)
	{
		
		printf("%4d",p->data);
		p=p->next;
	}
}

Status panduan(DuLinkList H)
{
	DuLNode *p,*q;
	p=H->next;
	q=H->prior;
	while(p!=q)
		if(p->data==q->data)
		{
			p=p->next;
			q=q->prior;
		}
		else return(0);
	return(1);
}

void main()
{
    int i;
	DuLinkList H;
	Init_DuLinkList(H);
    Input(H,8);
	Print(H);
	printf("\n");
	i=panduan(H);
	if(i==1)
		printf("对称\n");
	else
		printf("不对称\n");
}