数据结构之栈和队列

/**
* 栈
* @author asdc
*
*/
public interface Stack<T> {

/**
* 入栈
* @param e
* @return
*/
T push(T e);

/**
* 出栈
* @return
*/
T pop();

/**
* 返回栈顶部对象
* @return
*/
T peek();

/**
* 判断当前栈是否为空
* @return
*/
boolean empty();

/**
* 返回当前栈的大小
* @return
*/
int size();

}

public interface Queue<T> {

/**
* 入队
* @param e
* @return
*/
T enqueue(T e);

/**
* 出队
* @return
*/
T dequeue();

/**
* 返回队首元素
* @return
*/
T front();

}

/**
* 栈的应用
* @author asdc
*
*/
public class StackApplication {

/**
* 进制转换 将10进制的数转换为任意进制的数
* @param num
* @param base
* @return
*/
public int convert(int num, int base){

String[] bit = {"0","1","2","3","4","5","6","7","8","9","A","B","C","D","E","F"};

Stack<String> temp = new StackImpl<>();
while(num != 0){

temp.push(bit[num % base]);
num = num / base;

}

String newNumStr = "";
while(!temp.empty()){

newNumStr = newNumStr + temp.pop();

}

return Integer.parseInt(newNumStr);

}

}