棧的先進(jìn)后出的算法演示程序

1、棧的先進(jìn)后出的算法演示程序樓主ysycrazy(風(fēng)中狂2006-03-29 15:08:25 在Java / J2SE / 基礎(chǔ)類提問(wèn)/*棧的先進(jìn)后出的算法演示程序,請(qǐng)各位大俠指教。*/public class ThreadTestpublic static void main(String args/從命令行參數(shù)中獲得該棧的大小MyStack st = new MyStack(new Integer(Value(; new Thread(new Producer(st.start(;new Thread(new Customer(st.start(;class MyStac

2、k /棧char data ;private int index = 0;private boolean bFull = false;public MyStack(int sizedata = new charsize;public synchronized void pushData(char c /往棧中推數(shù)據(jù)if (bFulltrythis.wait(;catch(Exception e;dataindex=c;tryThread.sleep(300;catch(InterruptedException ieie.printStackTrace(;index+;if (index = d

3、ata.lengthbFull = true;if (bFullthis.notify(;public synchronized char popData( /從棧中取數(shù)據(jù)if (!bFulltrythis.wait(;catch(Exception ee.printStackTrace(;char c;index-;tryThread.sleep(300;catch(InterruptedException ieie.printStackTrace(;c=dataindex;if (index=0bFull = false;if (!bFullthis.notify(;return c;cl

4、ass Producer implements RunnableMyStack st;public Producer(MyStack stthis.st=st;public void run(while (truest.pushData(char(Math.random( * 26 + 'A'class Customer implements RunnableMyStack st;public Customer(MyStack stthis.st=st;public void run(while (truest.popData(;JA V A堆棧問(wèn)題1懸賞分:0 - 解決時(shí)間:

5、2006-9-12 10:10class Stackprivate int stck=new int10;private int tos;Stack(tos=-1;void push(int itemif(tos=9elsestck+tos=item;int pop(if(tos<0return 0;return stcktos-;class TestStackpublic static void main(String argsStack mystack1 = new Stack(;Stack mystack2 = new Stack(;for(int i=0;i<10;i+mystack1.push(i;for(int i=10;i<20;i+mystack2.push(i;for(int i=0;i<10;i+for(int i=0;i<10;i+前面方法里壓棧只寫(xiě)到9,而后面都出來(lái)10到20,為什么還可以提問(wèn)者:騰睿- 助理二級(jí)最佳答案因?yàn)闇y(cè)試程序構(gòu)造了