µ÷ÊÔÒ»¸ö¼òµ¥µÄ ¶ÓÁÐÎÊÌâ

love½äÇéÈË

Õâ¸ö¼òµ¥µÄ¶ÓÁÐÎÒûÔËÐгöÀ´ ¿ÉÄÜÊÇÊý¾Ý½á¹¹µÄÎÊÌâ Ò²¿ÉÄÜÊÇÓï·¨µÄÎÊÌâ
×Ü֮ϣÍû´ó¼Ò°ïÎÒµ÷ÊÔһϠлл´ó¼ÒÁË

#include<iostream.h>
class queue
{
public:
queue():front(0),back(0),size(0){}
queue(int m):front(0),back(0),size(m){}
void push(int i)
{
if(front-back>size)
cout<<"the queue is full"<<endl;
else
{
if(front==back)
{
a[back]=i;
front=front+1;
}
for(int j=back;j<front;j++)
{
a[j]=a[j+1];
a[back]=i;
front=front+1;
}
}
}
int pop()
{
if(front<=back)
return false;
else
{
return a[front-1];
front=front-1;
}
}
bool empty()
{
if(front==back)
return true;
else
return false;
}
void disp()
{
for(int i=back;i<front;i++)
{
cout<<a[i]<<" ";
}
cout<<endl;
}
private:
int back;
int front;
int size;
int a[100];
};
int main()
{
queue x(10);
x.push(3);
x.push(4);
x.push(5);
x.push(6);
x.disp();
return 0;
}

Á÷ÐÇ

pushÓÐÎÊÌ⣬µ±pushµÚÒ»¸öÖµµÄʱºò

˯ÔÚ·çÀï

ÎÒÓÖÐÞ¸ÄÁË Ò»Ï ´ó¼Ò¿´¿´Õâ¸öÐв»£¿Ð»Ð»´ó¼ÒµÄÖ¸½ÌÁË
#include<iostream.h>
class queue
{
public:
queue():front(0),back(0),size(0){}
queue(int m):front(0),back(0),size(m){}
void push(int i)
{
if(front-back>size)
cout<<"the queue is full"<<endl;
else
{
a[front]=i;
front=front+1;
}
}
int pop()
{
if(front<=back)
return false;
else
{
back=back+1;
return a[back-1];
}
}
bool empty()
{
if(front==back)
return true;
else
return false;
}
void disp()
{
for(int i=back;i<front;i++)
{
cout<<a[i]<<" ";
}
cout<<endl;
}
private:
int back;//Ö¸Ïò¶ÓÁÐÍ·
int front;//Ö¸Ïò¶ÓÁÐβ
int size;
int a[100];
};
int main()
{
queue x(10);
x.push(3);
x.push(4);
x.push(5);
x.push(6);
x.disp();
cout<<x.pop()<<endl;
x.disp();
return 0;
}

»÷ˮ֮ʯ

ÕâÑùÓе㲻Í×µ±~Äã¿ÉÒÔ°ÑbackºÍfirst×ö³ÉÑ­»·µÄ
ÓÃÒ»¸öf¼Ç¼firstµÄÔö¼ÓÖµ£¬b¼Ç¼backµÄÔö¼ÓÖµ
f-b=size-1˵Ã÷ΪÂú£¬·ñÔò·ÇÂú¡£
firstºÍback¶¼ÓÃ%=size×ö´¦Àí
ºóÃæµÄa[100];¿ÉÒÔд³É*a;È»ºóÔÚ¹¹Ô캯ÊýÖзÖÅäÄÚ´ænew int[size];

Çw‡ææÞlove

Â¥ÉϵÄÐÖµÜ Ð¡µÜÊý¾Ý½á¹¹Ñ§µÄ²»ºÃ ÄúÄܲ»ÄÜ°ïÎÒдһ¸ö°¡ ллÁË
ÕÕ×ÅÎÒÔ­À´µÄ¸Ä¶¯Ò»Ï¾ͿÉÒÔÁË Ð»Ð»ÁË
»òÕßÄÄλ¸ßÊÖ°ïÎÒдһÏÂÒ²ÐÐ

¦ðÆð¨K‡Ã©Y

Â¥ÉϵÄÐÖµÜ Ð¡µÜÊý¾Ý½á¹¹Ñ§µÄ²»ºÃ ÄúÄܲ»ÄÜ°ïÎÒдһ¸ö°¡ ллÁË
ÕÕ×ÅÎÒÔ­À´µÄ¸Ä¶¯Ò»Ï¾ͿÉÒÔÁË Ð»Ð»ÁË
»òÕßÄÄλ¸ßÊÖ°ïÎÒдһÏÂÒ²ÐÐ

¡ïº£ÀË¡ï

¸ÃʵÑéʵÏÖµÄÖ÷ÌâÊÇʲô°¡

»ð¼ýͲ¦î$¨|

#include<iostream>
using namespace std;
class queue
{
int f,b; //f±íʾfrontÒ»¹²Ôö¼ÓµÄ´ÎÊý£¬b±íʾback...
int front;//Ö¸Ïò¶ÓÁÐÍ·
int back;//Ö¸Ïò¶ÓÁÐβ
int size;
int *arr;
public:
queue():front(0),back(0),size(0){arr=NULL;}
queue(int m):front(0),back(0),size(m){f=b=0;arr=new int[size];}
~queue(){delete []arr;}
void push(int i)
{
if(b-f==size)
cout<<"the queue is full"<<endl;
else
{
arr[back]=i;
back++;b++;
back%=size;
}
}
int pop()
{
if(b==f)
{
cout<<"Can't pop from a empty queue~!"<<endl;
return -999;
}
else
{
front++;front%=size;f++;
return arr[front%size-1];
}
}
bool empty()
{
if(f==b)
return true;
else
return false;
}
void disp()
{
for(int i=front;i!=back;i++)
{
cout<<arr[i]<<" ";
//i%=size;
}
cout<<endl;
}
};
int main()
{
queue x(10);
x.push(3);
x.push(4);
x.push(5);
x.push(6);
x.disp();
cout<<x.pop()<<endl;
x.disp();
return 0;
}

¡¸¢ÙƒÑ12Ì–

лл¥ÉϵĴó¸çÁË Ö÷Ìâ¾ÍÊǶÓÁа¡