用栈实现十进制转换为x进制

package linkStack;

public class  {

   Node base;
   Node top;
    
 public void init() {
      base=new Node();
        top=new Node();
     
     base.data=null;
     base.next=null;
     
     top.data=null;
      top.next=base;
   }
    
 
 public void push(Object e) {
      Node node=new Node();
       node.data=e;
     
     //第一次入栈
     if(top.next==base) {
            node.next=base;
          top.next=node;
       }else {
         node.next=top.next;
          top.next=node;
       }
    }
    
 //出栈
    public void pop() {
       if(top.next==base)
        {
            System.out.println("栈中没有元素！");
        }else
        {
            System.out.println(top.next.data);
            top.next=top.next.next;
        }
 }
    
 public boolean isEmpty() {
        if(top.next==base) {
            return true;
       }
        
     return false;
  }
    
 public void printNode() {
     Node temp=top;
       while(temp.next!=base) {
            temp=temp.next;
          System.out.println(temp.data);
       }
    }
    
 class Node{
       Object data;
     Node next;
   }
}

package linkStack;

public class DToX {
//十进制转X进制
 public static void main(String[] args) {
     // TODO Auto-generated method stub

     LinkStack stack=new LinkStack();
        stack.init();
        
     int d=16;//十进制数100
     int x=2;//转为二进制
        
     while(d!=0) {
           stack.push(d%x);
         d=d/x;
       }
        
      while(!stack.isEmpty())
            {
                stack.pop();
         }
    }

}