Merge pull request #10 from Data-Structure-Study/hamill

[Hamill] feat : Array, ArrayList, LinkedList 로 Stack 구현

Author: ksundong

Diff for: .idea/.gitignore

@@ -197,61 +197,3 @@ public void display() {
         System.out.println();
     }
 }
-
-class Link {
-    /**
-     * Value of node
-     */
-    public int value;
-    /**
-     * This points to the link in front of the new link
-     */
-    public Link next;
-    /**
-     * This points to the link behind the new link
-     */
-    public Link previous;
-
-    /**
-     * Constructor
-     *
-     * @param value Value of node
-     */
-    public Link(int value) {
-        this.value = value;
-    }
-
-    /**
-     * Displays the node
-     */
-    public void displayLink() {
-        System.out.print(value + " ");
-    }
-
-    /**
-     * Main Method
-     *
-     * @param args Command line arguments
-     */
-    public static void main(String[] args) {
-        DoublyLinkedList myList = new DoublyLinkedList();
-        myList.insertHead(13);
-        myList.insertHead(7);
-        myList.insertHead(10);
-        myList.display();
-
-        myList.insertTail(11);
-        myList.display();
-
-        myList.deleteTail();
-        myList.display();
-
-        myList.delete(7);
-        myList.display();
-
-        myList.insertOrdered(23);
-        myList.insertOrdered(67);
-        myList.insertOrdered(3);
-        myList.display();
-    }
-}

Diff for: .idea/java-datastructure.iml

@@ -0,0 +1,59 @@
+package com.codesquad.datastructurestudy.linkedlist;
+
+public class Link {
+    /**
+     * Value of node
+     */
+    public int value;
+    /**
+     * This points to the link in front of the new link
+     */
+    public Link next;
+    /**
+     * This points to the link behind the new link
+     */
+    public Link previous;
+
+    /**
+     * Constructor
+     *
+     * @param value Value of node
+     */
+    public Link(int value) {
+        this.value = value;
+    }
+
+    /**
+     * Displays the node
+     */
+    public void displayLink() {
+        System.out.print(value + " ");
+    }
+
+    /**
+     * Main Method
+     *
+     * @param args Command line arguments
+     */
+    public static void main(String[] args) {
+        DoublyLinkedList myList = new DoublyLinkedList();
+        myList.insertHead(13);
+        myList.insertHead(7);
+        myList.insertHead(10);
+        myList.display();
+
+        myList.insertTail(11);
+        myList.display();
+
+        myList.deleteTail();
+        myList.display();
+
+        myList.delete(7);
+        myList.display();
+
+        myList.insertOrdered(23);
+        myList.insertOrdered(67);
+        myList.insertOrdered(3);
+        myList.display();
+    }
+}

Diff for: .idea/misc.xml

@@ -6,7 +6,7 @@ public class LinkedList {
     private Node tail;
     private int size = 0;
 
-    private static class Node {
+    public static class Node {
         // 데이터가 저장될 필드
         private Object data;
         // 다음 노드를 가리키는 필드

Diff for: .idea/modules.xml

@@ -0,0 +1,64 @@
+package com.codesquad.datastructurestudy.stack;
+
+public class FixedSizeArrayStack {
+    protected int capacity;
+
+    public static final int CAPACITY = 16;
+
+    protected int[] stackArray;
+
+    protected int top = -1;
+
+    public FixedSizeArrayStack() {
+        this(CAPACITY);
+    }
+
+    public FixedSizeArrayStack(int cap) {
+        this.capacity = cap;
+        this.stackArray = new int[capacity];
+    }
+
+    public int size() {
+        return (top + 1);
+    }
+
+    public boolean isEmpty() {
+        return (top < 0);
+    }
+
+    public void push(int data) throws Exception {
+        if (size() == capacity) {
+            throw new Exception("Stack is full.");
+        }
+        stackArray[++top] = data;
+    }
+
+    public int peek() throws Exception {
+        if (isEmpty()) {
+            throw new Exception("Stack is empty");
+        }
+        return stackArray[top];
+    }
+
+    public int pop() throws Exception {
+        int data;
+        if (isEmpty()) {
+            throw new Exception("Stack is empty");
+        }
+        data = stackArray[top];
+        stackArray[top--] = Integer.MIN_VALUE;
+        return data;
+    }
+
+    public static void main(String[] args) throws Exception {
+        FixedSizeArrayStack myStack = new FixedSizeArrayStack(2);
+        myStack.push(5);
+        myStack.push(8);
+
+        System.out.println("*********************Fixed Stack Array Implementation*********************");
+        System.out.println("Size of stack : " + myStack.size());
+        System.out.println("Pop element from Stack : " + myStack.pop());
+        System.out.println("Pop element from Stack : " + myStack.pop());
+        System.out.println("Pop element from Stack : " + myStack.pop());
+    }
+}