棧

棧只允許訪問一個數據項：即最后插入的數據項。移除這個數據項后才能訪問倒數第二個插入的數據項，以此類推。

大部分微處理器運用基于棧的體系結構。當調用一個方法時，將它的返回地址和參數壓入棧，當方法結束返回時，那些數據出棧。棧操作就嵌入在微處理器中。

?

package zhan;public class Demo01 {public static void main(String[] args) {StackX stackX = new StackX(10);stackX.push(20);stackX.push(30);stackX.push(40);stackX.push(50);System.out.println(stackX.peek());//50while(!stackX.isEmpty()){long value = stackX.pop();System.out.print(value + " ");//50 40 30 20}} } class StackX{private int maxSize; //棧的大小private long[] stackArray;private int top; //棧頂public StackX(int s){maxSize = s; //棧大小stackArray = new long[maxSize]; //創建棧top = -1; //此時還沒有棧頂}public void push(long j){stackArray[++top] = j; //將元素置于棧頂}public long pop(){return stackArray[top--]; //從棧頂取出元素}public long peek(){return stackArray[top]; //查看棧頂元素}public boolean isEmpty(){return (top == -1); //棧為空則為true}public boolean isFull(){return (top == maxSize-1); //棧滿為true} }

棧實例1：單詞逆序

package zhan;import java.util.Scanner; import java.util.Stack;/* 單詞逆序*/ public class eg1 {public static void main(String[] args) {System.out.println("Please enter a string:");Scanner scan = new Scanner(System.in);String str = scan.nextLine();String res = reverse(str);System.out.println("reverse:"+ res);/*輸出結果：Please enter a string:helloreverse:olleh*/}public static String reverse(String str){Stack<Character> stack = new Stack<>(); //定義一個棧for (int i = 0; i < str.length(); i++) {char c = str.charAt(i);stack.push(c);}String res = "";while(!stack.isEmpty()){char r = stack.pop();res += r;}return res;} }

棧實例2：匹配分隔符

思路：

package zhan;import java.util.Stack;/*分配符匹配a{b(c[d]e)f}*/ public class eg2 {public static void main(String[] args) {String str = "a{b(c[d]e)f}";Stack<Character> stack = new Stack<>();int count = 0;for (int i = 0; i < str.length(); i++) {char c = str.charAt(i);if (c=='(' || c=='[' || c=='{'){stack.push(c);}if ((c==')' && '('==stack.peek()) || (c==']' && '['==stack.peek())|| (c=='}' && '{'==stack.peek()) ){stack.pop();count++;} else if ((c==')' && '('!=stack.peek()) || (c==']' && '['!=stack.peek())|| (c=='}' && '{'!=stack.peek())) {break;}}System.out.println("共有匹配括號：" + count + "個！");} }

?

總結

以上是生活随笔為你收集整理的浅析栈的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。