package Algorithm;
/**
* 栈
* 1.先进后出
* 2.对插入/删除操作的“限定”,只能在表的一端进行插入删除操作
* 3.遍历数据速度不同,最先放入最后取出,遍历数据需要开辟临时空间
*/
public class MyStack {
private Object[] data;
private int size;
private int top;
public MyStack() {
super();
this.data = new Object[10];
this.size = 0;
}
public void push(Object o){
data[top++] = o;
size++;
}
public Object pop(){
size--;
return data[--top];
}
public Object peek(){
return data[top-1];
}
public static void main(String[] args) {
MyStack s = new MyStack();
s.push(1);
s.push(2);
s.push(3);
System.out.println(s.peek());
System.out.println(s.pop());
System.out.println(s.pop());
}
}
转载于:https://my.oschina.net/elain/blog/503724