C语言实现基于链表的回文数判断

#include <iostream>
#include<stdio.h>
#include<stdlib.h> 
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int size=0;
typedef struct no
{
   
int data;
struct no *pnext; //定义链表 
struct no *ppre;
}node;

typedef struct 
{
   
node head;
node tail;       //链表头尾节点 

}lht;

void link_init(lht *p)
 {
   
 	p->head.pnext=&p->tail;
 	p->head.ppre=NULL;
 	p->tail.pnext=NULL;
 	p->tail.ppre=&p->head;   //初始化链表 
 }


int link_add(lht *p,int i)
{
   
  	node *pf=NULL,*pm=NULL,*pl=NULL,*pn=NULL