栈的先进后出的算法演示程序

1、栈的先进后出的算法演示程序楼主ysycrazy(风中狂2006-03-29 15:08:25 在Java / J2SE / 基础类提问/*栈的先进后出的算法演示程序,请各位大侠指教。*/public class ThreadTestpublic static void main(String args/从命令行参数中获得该栈的大小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 /往栈中推数据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( /从栈中取数据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堆栈问题1悬赏分:0 - 解决时间:

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+前面方法里压栈只写到9,而后面都出来10到20,为什么还可以提问者:腾睿- 助理二级最佳答案因为测试程序构造了