顺序栈

Author: FantasyLWX

README.md

@@ -42,6 +42,12 @@
 [circular-linked-list]: ./src/com/fantasy/datastructure/linkedlist/CircularLinkedList.java
 [doubly-linked-list]: ./src/com/fantasy/datastructure/linkedlist/DoublyLinkedList.java
 
+### 栈
+
+- [顺序栈][array-stack]
+
+[array-stack]: ./src/com/fantasy/datastructure/stack/ArrayStack.java
+
 ### 二叉树
 
 - [实现一个二叉查找树，支持增删查改操作][binary-search-tree]

src/com/fantasy/datastructure/stack/ArrayStack.java

@@ -0,0 +1,70 @@
+package com.fantasy.datastructure.stack;
+
+/**
+ * 顺序栈
+ *
+ * <pre>
+ *     author  : Fantasy
+ *     version : 1.0, 2020-08-30
+ *     since   : 1.0, 2020-08-30
+ * </pre>
+ */
+public class ArrayStack {
+    /**
+     * 数组容器
+     */
+    private int[] mData;
+    /**
+     * 当前元素个数
+     */
+    private int mSize;
+
+    public ArrayStack() {
+        this(10);
+    }
+
+    public ArrayStack(int capacity) {
+        if (capacity < 0) {
+            throw new IllegalArgumentException("Illegal Capacity: " + capacity);
+        }
+
+        mData = new int[capacity];
+    }
+
+    public int push(int item) {
+        if (mSize == mData.length) {
+            throw new IllegalArgumentException("Stack full");
+        }
+
+        mData[mSize++] = item;
+        return item;
+    }
+
+    public int pop() {
+        if (mSize == 0) {
+            throw new IllegalArgumentException("Stack empty");
+        }
+
+        int obj = mData[mSize - 1];
+        mSize--;
+
+        return obj;
+    }
+
+    public int peek() {
+        if (mSize == 0) {
+            throw new IllegalArgumentException("Stack empty");
+        }
+
+        return mData[mSize - 1];
+    }
+
+    public boolean empty() {
+        return size() == 0;
+    }
+
+    public int size() {
+        return mSize;
+    }
+
+}

src/com/fantasy/datastructure/stack/test/ArrayStackTest.java

@@ -0,0 +1,28 @@
+package com.fantasy.datastructure.stack.test;
+
+import com.fantasy.datastructure.stack.ArrayStack;
+
+/**
+ * “顺序栈”的测试类
+ *
+ * <pre>
+ *     author  : Fantasy
+ *     version : 1.0, 2020-08-30
+ *     since   : 1.0, 2020-08-30
+ * </pre>
+ */
+public class ArrayStackTest {
+
+    public static void main(String[] args) {
+        ArrayStack stack = new ArrayStack();
+        stack.push(1);
+        stack.push(2);
+        stack.push(3);
+        stack.push(4);
+        stack.push(5);
+        System.out.println(stack.pop());
+        System.out.println(stack.peek());
+        System.out.println("size : " + stack.size());
+    }
+
+}