#include "stdafx.h"
#include <malloc.h>
//#define DATA int //等价于typedef int DATA;
typedef int DATA;
struct sNode
{
DATA data;//数据
sNode* pNext;//指针
};
sNode* pHead = NULL;
void addHead(DATA data)
{
sNode* p = (sNode*)malloc(sizeof(sNode));
p->data = data;
p->pNext = pHead;
pHead = p;
}
void addTail(DATA data)
{
}
//0:失败,1:成功
int del(DATA data)
{
}
void prit()
{//遍历链表方法
sNode* p = pHead;
while (p !=NULL)
{
p = p->pNext;
}
}
//替换
int mod(DATA data,DATA newData)
{
}
//0:失败,1:成功
int find(DATA data)
{
}
int main()
{
addHead(3);
prit();
return 0;
sNode* p = pHead;//临时头指针
while (p !=NULL)//判断下一个指针
{
p = p->pNext;//指向下一个地址
}
*/
#include <malloc.h>
//#define DATA int //等价于typedef int DATA;
typedef int DATA;
struct sNode
{
DATA data;//数据
sNode* pNext;//指针
};
sNode* pHead = NULL;
void addHead(DATA data)
{
sNode* p = (sNode*)malloc(sizeof(sNode));
p->data = data;
p->pNext = pHead;
pHead = p;
}
void addTail(DATA data)
{
}
//0:失败,1:成功
int del(DATA data)
{
}
void prit()
{//遍历链表方法
sNode* p = pHead;
while (p !=NULL)
{
p = p->pNext;
}
}
//替换
int mod(DATA data,DATA newData)
{
}
//0:失败,1:成功
int find(DATA data)
{
}
int main()
{
addHead(3);
prit();
return 0;
}
/* 链表操作:
遍历链表方法sNode* p = pHead;//临时头指针
while (p !=NULL)//判断下一个指针
{
p = p->pNext;//指向下一个地址
}
*/