底层用链表实现
1.push:插入函数(采用头插法-head为栈顶)
public void push(int data){//头插法插入元素
if(size == 0){//判断是否为空
head = new Node(data);
}
Node node = new Node(data);//存储节点数据
node.next = head;//将新节点和之前的节点连接
head = node;//将head设置为头节点
size++;
}
2.pop:取出函数(从head处取出函数)
public void pop(){
if(size == 0){//判断栈是否为空
System.out.println("栈为空");
return;
}
System.out.println(head.value);
head = head.next;//将head后移
size--;
}
3.list:展示函数(展示链表中所有的元素)
public void list(){
if(size>0){//判断栈是否为空
Node node = head;//接收头节点
if(size==1){//若存入一个节点,则直接输出
System.out.println(head.value);
return;
}
while(size>0){//循环取出节点中的数据
System.out.println(node.value+",");
node = node.next;//节点后移
size--;
}
}else {
System.out.println("栈为空");
}
}
4.总体的代码为
package stack;
import java.util.Scanner;
class Node{
int value;
Node next;
public void show(){
System.out.println(value+" ");
}
public Node(int value, Node next) {
this.value = value;
this.next = next;
}
public Node(int value) {
this.value = value;
}
public Node() {
this.value = value;
}
@Override
public String toString() {
return "Node{" +
"index=" + value +
", next=" + next +
'}';
}
}
public class StackDemo3 {
Node head;
public int size;//栈的大小
public void push(int data){//头插法插入元素
if(size == 0){//判断是否为空
head = new Node(data);
}
Node node = new Node(data);
node.next = head;
head = node;
size++;
}
public void pop(){
if(size == 0){//判断栈是否为空
System.out.println("栈为空");
return;
}
System.out.println(head.value);
head = head.next;//将head后移
size--;
}
public void peek(){
if(size == 0){
System.out.println("栈为空");
}
System.out.println(head.value);
}
public void list(){
if(size>0){//判断栈是否为空
Node node = head;//接收头节点
if(size==1){//若存入一个节点,则直接输出
System.out.println(head.value);
return;
}
while(size>0){//循环取出节点中的数据
System.out.println(node.value+",");
node = node.next;//节点后移
size--;
}
}else {
System.out.println("栈为空");
}
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.println("输入栈的大小");
StackDemo3 stackDemo = new StackDemo3();
while(true){
System.out.println("pop取出数据");
System.out.println("push存入数据");
System.out.println("list展示数据");
System.out.println("exit展示数据");
System.out.println("输入一个数");
String s=scanner.next();
switch (s){
case "pop":
stackDemo.pop();
break;
case "push":
int s1=scanner.nextInt();
stackDemo.push(s1);
break;
case "list":
stackDemo.list();
break;
case "exit":
break;
}
}
}
}