栈存储数据示例

使用弹栈

@SuppressWarnings("unused")

public class Test {

 

       @SuppressWarnings("unchecked")

       publicstatic void main(String[] args) {

              Stringstr = "[()]}";

              //定义一个存放字符串的容器

              LinkedListlist=new LinkedList();

             

              //取字符并处理

              for(int i = 0; i < str.length(); i++) {

                     charc = str.charAt(i);

                     //判断字符是左符号还是右符号

                    

                     //

                     if(c == '(') {

                            list.addLast(')');

                     }

                     if(c == '[') {

                            list.addLast(']');

                     }

                     if(c == '{') {

                            list.addLast('}');

                     }

                     //弹出

                     if(c == ')' || c == ']' || c == '}') {

                            //判断栈里还有没有字符

                            if(list.size() == 0) {

                                   System.out.println("栈空了,不匹配");

                                   return;

                            }

 

                           

                            chart = (Character)list.removeLast();

                            //判断字符是否匹配

                            if(c != t) {

                                   System.out.println("弹出,不匹配");

                                   return;

                            }

                     }

              }

              //判断栈里还有没有字符

              if(list.size() != 0) {

                     System.out.println("栈没空,不匹配");

                     return;

              }

              System.out.println("Well............");

       }

       /*publicstatic void main(String[] args) {

              Stringstr = "([){";

              //定义一个存放字符串的容器

              Stackstack = new Stack();

             

              //取字符并处理

              for(int i = 0; i < str.length(); i++) {

                     charc = str.charAt(i);

                     //判断字符是左符号还是右符号

                    

                     //

                     if(c == '(') {

                            stack.push(')');

                     }

                     if(c == '[') {

                            stack.push(']');

                     }

                     if(c == '{') {

                            stack.push('}');

                     }

                     //弹出

                     if(c == ')' || c == ']' || c == '}') {

                            //判断栈里还有没有字符

                            if(stack.size() == 0) {

                                   System.out.println("栈空了,不匹配");

                                   return;

                            }

 

                            chart = (Character) stack.pop();

                            //判断字符是否匹配

                            if(c != t) {

                                   System.out.println("弹出,不匹配");

                                   return;

                            }

                     }

              }

              //判断栈里还有没有字符

              if(stack.size() != 0) {

                     System.out.println("栈没空,不匹配");

                     return;

              }

              System.out.println("Well............");

       }*/

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值