package test;
import java.util.LinkedList;
import java.util.Scanner;
public class Stack<T> {
private LinkedList<T> stack = new LinkedList<T>();
public void Push(T v){
stack.addFirst(v);
}
public T Pop(){
return stack.removeFirst();
}
public T Peek(){
return stack.getFirst();
}
public boolean Empty(){
return stack.isEmpty();
}
public String toString(){
return stack.toString();
}
public static void main(String[] args){
String S = null;
Stack<String> stackString = new Stack<String>();
Scanner cin = new Scanner(System.in);
S = cin.nextLine();
for(String s : S.split(" "))
stackString.Push(s);
while(!stackString.Empty())
System.out.print(stackString.Pop() + " ");
System.out.println();
java.util.Stack<String> stackString2 = new java.util.Stack<>();
for(String s : S.split(" "))
stackString2.push(s);
while(!stackString2.empty())
System.out.print(stackString2.pop() + " ");
}
}
java实现栈stack+语句倒转
最新推荐文章于 2022-08-15 15:08:13 发布