java使用鏈棧實現數制轉換

標籤：

java實現鏈棧在前面有所介紹：http://www.cnblogs.com/lixiaolun/p/4644141.html

 

將前面java實現鏈棧的代碼稍作修改：

package linkedstack;public class LinkStack {private Element base;private Element top;class Element{public Object data;public Element next;}/** * 初始化棧 * */public void initStack(){top = new Element();base = new Element();top.data=null;top.next=base;base.data=null;base.next=null;}/** * 入棧 * */public void push(Object o){Element e = new Element();e.data = o;if(top.next==base)//第一次入棧操作{e.next=base;top.next=e;}else{e.next=top.next;top.next=e;}}/** * 出棧 * */public Object pop(){Object o = null;if(top.next==base){System.out.println("棧中沒有元素！");return o;}else{o = top.next.data;//System.out.println("出棧操作"+o);top.next=top.next.next;}return o;}/** * 判斷棧是否為空白 * */public Boolean isEmpty(){if(top.next==base){return true;}return false;}/** * 列印棧 * */public void print(){System.out.print("列印棧：");Element temp =top;while(temp.next!=base){System.out.print(temp.next.data+"\t");temp =temp.next;}System.out.println();}}

　　

java實現數制轉換的類的代碼：

package stackapplication;import linkedstack.LinkStack;public class Conversion {public static void main(String[] args) {LinkStack lStack = new LinkStack();lStack.initStack();int N = 100;//原始十進位數int X = 2;//要轉化成X進位數while(N!=0){lStack.push(N%X);N=N/X;}while(!lStack.isEmpty()){System.out.print(lStack.pop());}}}

　　

java使用鏈棧實現數制轉換