java 栈实现(push,pop,peak)

public class StackX {

 private  int MAX_LENGTH = 10;
 private Object[] array;
 private int top;//栈顶
 
 public StackX(){
  array = new Object[MAX_LENGTH];
  top = -1;
 }
 
 public StackX(int size){
  MAX_LENGTH = size;
  array = new Object[MAX_LENGTH];
  top = -1;
 }
 
 public synchronized  Object pop(){
  if (top < 0)
   return null;
  return array[top--];
 }
 
 public synchronized void push(Object temp){
     if(isFull())
         expandSpace();
  array[++top] = temp;
 }
 
 private void expandSpace(){
  Object[] arrayLen = new Object[array.length*2];
  for(int i = 0,len = array.length;i<len;i++)
   arrayLen[i] = array[i];
  array = arrayLen;
 }
 
 public O