Some one answer this question on here, but I do not know where to include the pr
ID: 3871309 • Letter: S
Question
Some one answer this question on here, but I do not know where to include the print statement to print my stack. Can someone tell me where to include that statement.
import java.util.*;
public class ArrayStack {
private int[] arr;
private int n;
private int capacity;
public ArrayStack(int cap) {
capacity = cap;
n = 0;
arr = new int[cap];
}
public int size() {
return n;
}
public void showpush(Stack<Integer> stack, int item) {
if(n == capacity)
System.out.println("Stack is full");
else {
int a = 0;
arr[n] = item;
stack.push(n++);
}
}
public int pop() {
int data = -999;
if(n == 0)
System.out.println("Stack is full");
else {
data = arr[n-1];
n--;
} ArrayStack stack = new ArrayStack(10);
return data;
}
public void push(int i) {
// TODO Auto-generated method stub
}
}
class LinkedStack {
class Node {
int data;
Node next;
Node(int item) {
data = item;
}
}
private Node top;
private int n;
public LinkedStack() {
top = null;
n = 0;
}
public void push(int item) {
Node newNode = new Node(item);
newNode.next = top;
top = newNode;
n++;
}
public int size() {
return n;
}
public int pop() {
if(n == 0) {
return -999;
}
int data = top.data;
top = top.next;
n--;
return data;
}
}
class Driver {
public static void main(String[] args) {
ArrayStack stack = new ArrayStack(10);
stack.push(1);
stack.push(7);
stack.push(3);
stack.push(4);
stack.push(9);
stack.push(2);
LinkedStack stack1 = new LinkedStack();
stack1.push(1);
stack1.push(7);
stack1.push(3);
stack1.push(4);
stack1.push(9);
stack1.push(2);
System.out.println("stack: "); }
}
Explanation / Answer
import java.util.*;
public class ArrayStack {
private int[] arr;
private int n;
private int capacity;
public ArrayStack(int cap) {
capacity = cap;
n = 0;
arr = new int[cap];
}
public int size() {
return n;
}
public void showpush(Stack<Integer> stack, int item) {
if(n == capacity)
System.out.println("Stack is full");
else {
int a = 0;
arr[n] = item;
stack.push(n++);
}
}
public void printstack(Stack s){
int k=0;
while(s[k]!=''){
System.out.println(s[k]);
k++;
}
}
public int pop() {
int data = -999;
if(n == 0)
System.out.println("Stack is full");
else {
data = arr[n-1];
n--;
}
return data;
}
public void push(int i) {
// TODO Auto-generated method stub
if(n == capacity)
System.out.println("Stack is full");
else {
arr[n] = i;
n++;
}
}
}
class LinkedStack {
class Node {
int data;
Node next;
Node(int item) {
data = item;
}
}
private Node top;
private int n;
public LinkedStack() {
top = null;
n = 0;
}
public void printstack1(Stack s){
if(top== NULL){
System.out.println("Stack is Empty);
}else{
Node temp = top;
while(temp != NULL){
System.out.println(temp.item);
temp=temp.next;
}
}
public void push1(int item) {
Node newNode = new Node(item);
newNode.next = top;
top = newNode;
n++;
}
public int size() {
return n;
}
public int pop() {
if(n == 0) {
return -999;
}
int data = top.data;
top = top.next;
n--;
return data;
}
}
class Driver {
public static void main(String[] args) {
ArrayStack stack = new ArrayStack(10);
stack.push(1);
stack.push(7);
stack.push(3);
stack.push(4);
stack.push(9);
stack.push(2);
printstack(stack)
LinkedStack stack1 = new LinkedStack();
stack1.push1(1);
stack1.push1(7);
stack1.push1(3);
stack1.push1(4);
stack1.push1(9);
stack1.push1(2);
printstack1(stack1)
System.out.println("stack: "); }
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.