Skip to content

Create StackUsingArray.java #5797

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
72 changes: 72 additions & 0 deletions src/main/java/com/thealgorithms/stacks/StackUsingArray.java
Original file line number Diff line number Diff line change
@@ -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;

}
}
Loading