#include<iostream>
using namespace std;
int main()
{
int max(int a,int b); //函数声明
int (*p)(int a,int b); //定义指向函数的指针变量p
int a,b,m;
cout<<"请输入两个整数:"<<endl;
p=max; //使p指向指针变量p
cin>>a>>b;
m=p(a,b);
cout<<"max="<<m<<endl;
return 0;
}
int max(int a,int b)
{
int z;
if(a<b)
z=b;
else
z=a;
return z;
}
2.给链表中插入一个新节点
bool Insert(NODE *head, NODE *pNew, int i)
{
if (head == NULL || head->next == NULL)
{
return;
}
int j = 0;
NODE *p = head; //p指向头结点
while (p! = NULL && p < i - 1)
{
p = p->next;
j++;
}
if (p != NULL || i < j)
{
return -1;
}
pnew->next = p->next;
p->next = pnew;
return true;
}