#include <iostream>
using namespace std;
struct TNode
{
int Data;
TNode *Next;
};
void PrintList (TNode *list);
TNode *AddData (TNode *list, int data);
void FreeList (TNode *list);
///////////////////////////////////////////////////////
void PrintList (TNode *list)
{
TNode *p;
for (p=list; p!=0; p=p->Next)
{
cout<<p->Data<<endl;
}
}
//////////////////////////////////////////////////////
TNode *AddData (TNode *list, int data)
{
TNode *newnode;
newnode= new TNode;
if (newnode ==0)
{
cout<<"Memory Failure"<<endl;
}
newnode->Next =list;
newnode->Data =data;
return newnode;
}
///////////////////////////////////////////////////////
int GetMax(TNode *list)
{
if (list==0)
{
return 0;
}
int max;
max= list-> Data;
TNode *p;
for (p=list;p!=0; p=p->Next)
{
if (max < p->Data)
{
max=p->Data;
}
}
return max;
}
///////////////////////////////////////////////////////////
TNode *ReverseList (TNode *list)
{
if (list==0)
{
return 0;
}
TNode *next;
TNode *newlist=0;
TNode *p;
for(p=list->Next; p!=0; p=next)
{
next= p->Next;
p->Next=newlist;
newlist=p;
}
return newlist;
}
////////////////////////////////////////////////////
void FreeList (TNode *list)
{
TNode *p;
TNode *Next;
for (p=list; p!=0; p=Next)
{
Next= p->Next;
delete p;
}
}
/////////////////////////////////////////////////////////////////
void GetOddEven (TNode *list, TNode*&oddlist, TNode*&evenlist)
{
TNOde *finallist;
TNode *p;
TNode *Next;
for (p=list; p!=0;p=Next)
{
Next =p->Next;
p->Next= finallist;
finallist = p;
if (finallist %2==1)
{
oddlist=finallist;
return oddlist;
}
else if (finallist %2==0)
{
evenlist=finallist;
return evenlist;
}
}
}
//////////////////////////////////////////////////////
int main (void)
{
TNode *list;
list= 0;
for (;;)
{
int val;
cout<<"Enter #";
cin>>val;
if(val<=0)
{
break;
}
list = AddData (list, val);
}
PrintList(list);
cout<<"Max="<<GetMax(list)<<endl;
list=ReverseList(list);
PrintList(list);
TNode *oddlist;
TNode *evenlist;
cout<<GetOddEven(list,oddlist,evenlist)<<endl;
PrintList(list);
FreeList(list);
return 0;
}
| 