顺序栈：

  1. /*
  2.  * To change this license header, choose License Headers in Project Properties.
  3.  * To change this template file, choose Tools | Templates
  4.  * and open the template in the editor.
  5.  */
  6. package com.mycompany.data.structure.line.stack;
  8. /**
  9.  *
  10.  * @author wyman
  11.  */
  12. public class SequenceStack {
  14.     public int base, top = 0;
  15.     public int stacksiz = 0;
  16.     public int STACK_INIT_SIZE = 100;
  17.     public int STACKINCREMENT = 10;
  18.     public Object[] stackArr;
  20.     public SequenceStack(int stack_init_size, int stackincrement) {
  21.         this.STACKINCREMENT = stackincrement;
  22.         this.STACK_INIT_SIZE = stack_init_size;
  23.         stackArr = new Object[STACK_INIT_SIZE];
  24.         stacksiz = STACK_INIT_SIZE;
  25.     }
  27.     public SequenceStack() {
  28.         stackArr = new Object[STACK_INIT_SIZE];
  29.         stacksiz = STACK_INIT_SIZE;
  31.     }
  33.     public SequenceStack InitStack(int... size) {
  34.         if (size.length == 2) {
  35.             return new SequenceStack(size[0], size[1]);
  36.         } else if (size == null) {
  37.             return new SequenceStack();
  38.         } else {
  39.             return null;
  40.         }
  41.     }
  43.     public void destoryStack() {
  45.     }
  47.     public void ClearStack() {
  48.         this.top = this.base;
  49.     }
  51.     public boolean StackEmpty() {
  52.         if (this.top == this.base) {
  53.             return true;
  54.         }
  55.         return false;
  56.     }
  58.     public int StackLength() {
  59.         return this.top;
  60.     }
  62.     public Object getTop() {
  64.         return stackArr[this.top];
  65.     }
  67.     public void push(Object obj) {
  68.         if (this.top == this.stacksiz) {
  69.             Object[] newArr = new Object[this.stacksiz + this.STACKINCREMENT];
  70.             System.arraycopy(stackArr, 0, newArr, 0, stacksiz);
  71.             this.stacksiz += this.STACKINCREMENT;
  72.             stackArr = newArr;
  73.         }
  74.         stackArr[this.top] = obj;
  75.         this.top++;
  76.     }
  78.     public Object pop() {
  79.         if (this.top == this.base) {
  80.             return null;
  81.         } else {
  82.             this.top--;
  83.             return this.stackArr[this.top];
  85.         }
  86.     }
  88.     public void stackTraverse() {
  90.     }
  91. }

链栈：

  1. /**
  2.  *
  3.  * @author wyman
  4.  */
  5. public class StackElem {
  7.     public Object data;
  8.     public StackElem next;
  10.     public StackElem(Object data, StackElem next) {
  11.         this.data = data;
  12.         this.next = next;
  13.     }
  15.     public StackElem() {
  16.     }
  19. }
  20. ===========================================
  21. /**
  22.  *
  23.  * @author wyman
  24.  */
  25. public class LinkStack {
  27.     public int stacksiz = 0;
  28.     public StackElem top;
  29.     public StackElem base;
  31.     public LinkStack() {
  32.         this.top = new StackElem();
  33.         this.base = this.top;
  34.     }
  36.     public LinkStack InitStack() {
  37.         return new LinkStack();
  38.     }
  40.     public void destoryStack() {
  41.         this.top = null;
  42.     }
  44.     public void ClearStack() {
  45.         this.top = this.base;
  46.     }
  48.     public boolean StackEmpty() {
  49.         if (this.top == this.base) {
  50.             return true;
  51.         }
  52.         return false;
  53.     }
  55.     public int StackLength() {
  56.         return stacksiz;
  57.     }
  59.     public Object getTop() {
  60.         if (this.stacksiz > 0) {
  61.             return this.top;
  62.         }
  63.         return null;
  64.     }
  66.     public void push(Object obj) {
  67.         this.top.data=obj;
  68.         StackElem se = new StackElem();
  69.         se.next=this.top;
  70.         this.top = se;
  71.         stacksiz++;
  72.     }
  74.     public Object pop() {
  75.         if (this.stacksiz <= 0) {
  76.             return null;
  77.         } else {
  78.             this.top = this.top.next;
  79.             stacksiz--;
  80.             return this.top;
  81.         }
  82.     }
  84.     public void stackTraverse() {
  86.     }
  87. }