数组实现栈
package com.atguigu.stack;
import java.util.Scanner;
public class ArrayStackDemo {
public static void main(String[] args) {
ArrayStack stack = new ArrayStack(4);
String key = "";
boolean loop = true;
Scanner scanner = new Scanner(System.in);
while(loop) {
System.out.println("show:表示显示栈");
System.out.println("exit:退出程序");
System.out.println("push:表示添加数据到栈(入栈)");
System.out.println("pop:表示从栈取出数据(出栈)");
System.out.println("请输入你的选择");
key = scanner.next();
switch (key) {
case "show":
stack.list();
break;
case "push":
System.out.println("请输入一个数");
int value = scanner.nextInt();
stack.push(value);
break;
case "pop":
try {
int res = stack.pop();
System.out.printf("出栈的数据时%d\n",res);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case "exit":
scanner.close();
loop = false;
break;
default:
break;
}
}
System.out.println("程序退出~~~");
}
}
class ArrayStack{
private int maxSize;
private int[] stack;
private int top = -1;
public ArrayStack(int maxSize) {
this.maxSize = maxSize;
stack = new int[this.maxSize];
}
public boolean isFull() {
return top == maxSize - 1;
}
public boolean isEmpty() {
return top == -1;
}
public void push(int value) {
if(isFull()) {
System.out.println("栈满");
return;
}
top++;
stack[top] = value;
}
public int pop() {
if(isEmpty()) {
throw new RuntimeException("栈空,没有数据~");
}
int value = stack[top];
top--;
return value;
}
public void list() {
if(isEmpty()) {
System.out.println("栈空,没有数据~~");
return;
}
for(int i = top; i >= 0;i--) {
System.out.printf("stack[%d]=%d\n",i,stack[i]);
}
}
}
单链表实现栈
package com.atguigu.stack;
import java.util.Scanner;
import java.util.Stack;
public class LinkedListStack {
public static void main(String[] args) {
SingleLinkedListStack stack = new SingleLinkedListStack();
String key = "";
boolean loop = true;
Scanner scanner = new Scanner(System.in);
while(loop) {
System.out.println("show:表示显示栈");
System.out.println("exit:退出程序");
System.out.println("push:表示添加数据到栈(入栈)");
System.out.println("pop:表示从栈取出数据(出栈)");
System.out.println("请输入你的选择");
key = scanner.next();
switch (key) {
case "show":
stack.scan();
break;
case "push":
System.out.println("请输入一个数");
int value = scanner.nextInt();
TheNode node = new TheNode(value);
stack.push(node);
break;
case "pop":
stack.pop();
break;
case "exit":
scanner.close();
loop = false;
break;
default:
break;
}
}
System.out.println("程序退出~~~");
}
}
class TheNode{
public int data;
public TheNode next;
public TheNode(int data) {
this.data = data;
}
@Override
public String toString() {
return "TheNode [data=" + data + "]";
}
}
class ManageTheNode{
private TheNode head = new TheNode(0);
public TheNode getHead() {
return head;
}
public void addNode(TheNode node) {
TheNode temp = head;
while(true) {
if(temp.next != null) {
temp = temp.next;
} else {
break;
}
}
temp.next = node;
}
public int delNode() {
TheNode temp = head;
if(temp.next == null) {
throw new RuntimeException("栈为空~");
}
while(true) {
if(temp.next.next != null) {
temp = temp.next;
} else {
break;
}
}
int value = temp.next.data;
temp.next = null;
return value;
}
public void scan() {
TheNode temp = head;
while(true) {
if(temp.next != null) {
temp = temp.next;
System.out.println(temp.toString());
} else {
break;
}
}
}
}
class SingleLinkedListStack{
ManageTheNode stack = new ManageTheNode();
public void push(TheNode node) {
stack.addNode(node);
}
public void pop() {
int value = 0;
try {
value = stack.delNode();
System.out.printf("%d\n",value);
} catch (Exception e) {
System.out.println(e.getMessage());
}
}
public void scan() {
Stack<TheNode> stack2 = new Stack<TheNode>();
TheNode cur = stack.getHead().next;
if(cur == null) {
System.out.println("栈为空~");
}
while(cur != null) {
stack2.push(cur);
cur = cur.next;
}
while(stack2.size()>0) {
System.out.println(stack2.pop());
}
}
}
结果截图
数组实现栈结果截图
![数组实现栈结果截图](https://i-blog.csdnimg.cn/blog_migrate/03c508ea28e915dfaf2f0ce4af26c452.png)
单链表实现栈结果截图
![单链表实现栈结果截图](https://i-blog.csdnimg.cn/blog_migrate/ba4b525ae3ad5ea0713e4c548d3534b7.png)