用C++实现堆代码,C代码库,德仔网

代码语言
代码分类
【C】用C++实现堆
作者:Dezai.CN / 发布于2011/4/26/ 420
<div>//============================================================================//
// Stack Intersection
//============================================================================//
/*</div>
<div> There are two available stacks, user can handle both stacks by menu object
switching. First Fill those 2 stacks, then Ask to find intersection.
Intersection is done by comparisons & intersetcted elements are shifted
to a new stack for further application if required.</div>
<div>Note : No sentinal value techinque is used to remain stacks original elements
unchanged.</div>
<div>Fraz Jamshed : <a href="mailto:warbird43@gmail.com">warbird43@gmail.com</a></div>
<div>//============================================================================//
*/</div>
#include <iostream.h>
#include <conio.h>
#include <process.h></div>
<div>class Node;
class Node
{
 public:
 int data;
 Node *Next;
};</div>
<div>class Stack;
class Stack
{
 private:
 Node *Top;
 int Count;</div>
<div>public:
 Stack :: Stack();
 Stack :: ~Stack();
 bool Stack :: Push( int & );
 bool Stack :: Pop ( int & );
 bool Stack :: Display ( void );
 void Stack :: topStack( int & );
 void Stack :: Intersection ( Stack & , Stack & );
 int Stack :: getTop();</div>
<div>};</div>
<div>
//============================================================================//
// Constructor
//============================================================================//</div>
<div>Stack :: Stack ()
{
Count = 0;
Top = NULL ;
}
<div>
//============================================================================//
// Destructor
//============================================================================//</div>
<div>Stack :: ~Stack ()
{
while( Top!=NULL )
{
 Node * temp;
 temp = Top ;
 Top = Top->Next;
 delete temp;
}
}
<div>
//============================================================================//
// Push Stack
//============================================================================//</div>
<div>bool Stack :: Push ( int & value )
{
 Node * temp = new Node ;</div>
if(!temp)
return false;</div>
<div>temp->data = value;
temp->Next = NULL;</div>
if( Top == NULL )
Top = temp ;</div>
<div>else
{
 temp->Next = Top ;
 Top = temp;
}
<div>Count++;</div>
<div>return true;
}
<div>//============================================================================//
// Pop Stack
//============================================================================//</div>
<div>bool Stack :: Pop ( int & value )
{
 if( Top == NULL )
return false;</div>
<div>else
{
 value = Top->data ;
 Node * temp = Top ;
 Top = Top->Next ;
 delete temp;
}
<div>Count--;</div>
<div>return true;</div>
<div>}
<div>//============================================================================//
// Display Stack
//============================================================================//</div>
<div>bool Stack :: Display ( void )
{
if ( !Top )
 return false;</div>
<div>else
{
 Node * temp = Top;</div>
<div> for( ; Top != NULL ; Top = Top->Next )
 {
 cout<<Top->data<<endl;
 }
<div> Top = temp ;
}
<div>
return true;
}
<div>//============================================================================//
// Top Stack
//============================================================================//</div>
<div>void Stack :: topStack ( int & value )
{
 value = Top->data ;
}
<div>//============================================================================//
// Menu Launcher
//============================================================================//</div>
<div>void mainMenu( Stack & Object )
{</div>
<div>
int iPin , x ;</div>
<div> while(1)
 {clrscr();</div>
<div>
 cout<<"[1]\t Push\n";
 cout<<"[2]\t Pop\n";
 cout<<"[3]\t Top\n";
 cout<<"[4]\t Display\n";
 cout<<"[0]\t Exit\n";</div>
<div> cin>>iPin;</div>
<div> switch ( iPin )
 {</div>
<div> case 1:</div>
<div> {
 cout<<"Enter Value :";
 cin>>x;
 bool flag = Object.Push(x);
 if( flag == false )
 cout<<"\a\n================\nMemory Not allocated\n================\n";
 break;
 }
<div> case 2:</div>
<div> {</div>
<div> clrscr();
 int x;
 bool flag = Object.Pop(x);
 if ( flag == false )
 cout<<"\a\n================\nEmpty\n================\n"<<endl;
 else
 cout<<"\n================\nPopped = "<<x<<"\n================\n"<<endl;
 getch();
 break;
 }
<div>
 case 3:</div>
<div> {
 clrscr();
 Object.topStack(x);
 cout<<"Top = "<<x<<endl;
 getch();
 break;
 }
<div>
 case 4:</div>
<div> {
 clrscr();
 bool flag = Object.Display();
 if( flag == false )
 cout<<"Stack Empty";
 getch();
 break;
 }
<div>
 case 0:
 return;</div>
<div>
 default:
 cout<<"\a";</div>
<div>
 }
 }
getch();
}
<div>
//============================================================================//
// Object Switch
//============================================================================//</div>
<div>
void ObjectSwitch( Stack & O, Stack & O2 , Stack & newObj )
{</div>
<div>char choice = '1';
while(choice!=27)
{
 clrscr();</div>
<div> cout<<"[1] Select Stack1"<<endl;
 cout<<"[2] Select Stack2"<<endl;
 cout<<"[3] Evaluate Intersection"<<endl;
 cout<<"[Esc] ..Exit"<<endl;</div>
<div> choice=getch();</div>
<div> switch( choice )
 {
 case '1':
 {
 mainMenu( O );
 break;
 }
<div> case '2':
 {
 mainMenu( O2 );
 break;
 }
 case '3':
 {
 O.Intersection( O2 , newObj );
 break;
 }
 case 27:
 {
 exit(1);
 }
 default:
 cout<<"\a";
 }
<div>}
<div></div>
<div>}
<div>//============================================================================//
// Get Top
//============================================================================//</div>
<div>int Stack :: getTop()
{
 return this->Top->data;
}
<div>//============================================================================//
// Stack Intersection
//============================================================================//</div>
<div>
void Stack :: Intersection ( Stack &O2 , Stack &newObj )
{</div>
<div>
clrscr();
cout<<"\nComparisons for Intersection...\n\n";</div>
<div>{</div>
if ( !O2.Top && !this->Top )
{
 cout<<"\a";
 return;
}
<div>else
{</div>
<div> Node * temp = this->Top;</div>
<div> for( ; this->Top != NULL ; this->Top = this->Top->Next )
 {
 Node * temp2 = O2.Top;
 for( ; O2.Top != NULL ; O2.Top = O2.Top->Next )
 {
 cout<<this->Top->data<<" :: "<<O2.Top->data<<endl;</div>
<div> if( this->Top->data == O2.Top->data )
 {
 newObj.Push(this->Top->data);
 }
 }
<div> cout<<endl;
 O2.Top = temp2 ;
 }
<div> this->Top = temp ;</div>
<div>}
}
<div>cout<<"\nNew Stack :: Intersected data from both Stacks...\n\n";</div>
<div>{</div>
if ( !newObj.Top )
 {
 cout<<"Stacks Mutually Exclusive!";
}
<div>else
{
 Node * temp = newObj.Top;</div>
<div> for( ; newObj.Top != NULL ; newObj.Top = newObj.Top->Next )
 {
 cout<<newObj.Top->data<<endl;
 }
<div> newObj.Top = temp ;
}
<div>}
<div>
getch();
}
<div></div>
<div>//============================================================================//
// * * *
//============================================================================//</div>
<div>
main()
{
 Stack Object1 ;
Stack Object2 ;
Stack Object3 ;
ObjectSwitch(Object1,Object2,Object3);
}
评论列表
本站所提供的代码，版权归原作者所有，若有侵犯作者版权，请与我们联系，我们将立即删除或修改。谢谢!
本站所有代码发布及提供者。
试试其它关键字
　实现堆　
同语言下
可能有用的
Dezai.CN贡献的其它代码(4037)