Java实现一个简单的栈将十进制转为二进制、八进制、十六进制打印输出
- 栈的主要方法:
- push(); //入栈
- pop(); //出栈并返回栈顶值
- empty(); //判断栈是否为空
- peek(); //获取栈顶的值
- search(elem); //判断元素elem是否在栈中
栈的定义
public class Stack {
private int maxSize;
private int[] stack;
private int top = -1;
public Stack(int maxSize) {
this.maxSize = maxSize;
stack = new int[this.maxSize];
}
int peek(){
return stack[top];
}
boolean isEmpty() {
return top == -1;
}
boolean isFull() {
return top == maxSize - 1;
}
void push(int val){
if(isFull()){
System.out.println("栈已满~~");
return;
}
top++