From 7f108fda0633b55b64ec724b8da2b16915f38b9d Mon Sep 17 00:00:00 2001
From: Shreya Singh <singhshreya.bhriguvanshi@gmail.com>
Date: Mon, 14 Oct 2024 11:28:25 +0530
Subject: [PATCH] Create StackUsingArray.java

A program to implement a Stack using Array. Task is to use the class as shown in the comments in the code editor and complete the functions push() and pop() to implement a stack. The push() method takes one argument, an integer 'x' to be pushed into the stack and pop() which returns an integer present at the top and popped out from the stack. If the stack is empty then return -1 from the pop() method.
---
 .../thealgorithms/stacks/StackUsingArray.java | 72 +++++++++++++++++++
 1 file changed, 72 insertions(+)
 create mode 100644 src/main/java/com/thealgorithms/stacks/StackUsingArray.java

diff --git a/src/main/java/com/thealgorithms/stacks/StackUsingArray.java b/src/main/java/com/thealgorithms/stacks/StackUsingArray.java
new file mode 100644
index 000000000000..c6c367fa55ce
--- /dev/null
+++ b/src/main/java/com/thealgorithms/stacks/StackUsingArray.java
@@ -0,0 +1,72 @@
+//{ Driver Code Starts
+import java.util.*;
+
+// Define MyStack class here
+
+public class Main {
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        int T = scanner.nextInt();
+        scanner.nextLine(); // Flush the newline character left by nextInt
+        while (T-- > 0) {
+            MyStack sq = new MyStack();
+            String line = scanner.nextLine();
+            Scanner ss = new Scanner(line);
+            List<Integer> nums = new ArrayList<>();
+            while (ss.hasNextInt()) {
+                int num = ss.nextInt();
+                nums.add(num);
+            }
+            int n = nums.size();
+            int i = 0;
+            while (i < n) {
+                int QueryType = nums.get(i++);
+                if (QueryType == 1) {
+                    int a = nums.get(i++);
+                    sq.push(a);
+                } else if (QueryType == 2) {
+                    System.out.print(sq.pop() + " ");
+                }
+            }
+            System.out.println();
+        }
+        scanner.close();
+    }
+}
+
+// } Driver Code Ends
+
+
+class MyStack {
+    private int[] arr;
+    private int top;
+
+    public MyStack() {
+        arr = new int[1000];
+        top = -1;
+        
+        }
+
+    public void push(int x) {
+        // Your Code
+        top++;
+        if(top<arr.length)
+             arr[top]=x;
+            
+    
+    }
+
+    public int pop() {
+        // Your Code
+        int ans=-1;
+        if(top==-1)
+        return ans;
+        else{
+             ans=arr[top];
+            top--;
+        }
+        return ans;
+        
+    }
+}