括号/括号匹配使用堆栈算法

本文介绍了括号/括号匹配使用堆栈算法的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！ 问题描述

例如，如果括号/括号在以下内容中匹配：

For example if the parenthesis/brackets is matching in the following:

({}) (()){}() ()

依此类推，但如果括号/括号不匹配它应该返回false，例如：

and so on but if the parenthesis/brackets is not matching it should return false, eg:

{} ({}( ){}) (()

依此类推。请查看此代码？谢谢事先。

and so on. Can you please check this code? Thanks in advance.

public static boolean isParenthesisMatch(String str) { Stack<Character> stack = new Stack<Character>(); char c; for(int i=0; i < str.length(); i++) { c = str.charAt(i); if(c == '{') return false; if(c == '(') stack.push(c); if(c == '{') { stack.push(c); if(c == '}') if(stack.empty()) return false; else if(stack.peek() == '{') stack.pop(); } else if(c == ')') if(stack.empty()) return false; else if(stack.peek() == '(') stack.pop(); else return false; } return stack.empty(); } public static void main(String[] args) { String str = "({})"; System.out.println(Weekly12.parenthesisOtherMatching(str)); }

推荐答案

你的代码在处理'{'和'}'字符时有些混乱。它应该与你处理'（'和'）'的方式完全平行。

Your code has some confusion in its handling of the '{' and '}' characters. It should be entirely parallel to how you handle '(' and ')'.

此代码稍微修改后，似乎工作正常：

This code, modified slightly from yours, seems to work properly:

public static boolean isParenthesisMatch(String str) { if (str.charAt(0) == '{') return false; Stack<Character> stack = new Stack<Character>(); char c; for(int i=0; i < str.length(); i++) { c = str.charAt(i); if(c == '(') stack.push(c); else if(c == '{') stack.push(c); else if(c == ')') if(stack.empty()) return false; else if(stack.peek() == '(') stack.pop(); else return false; else if(c == '}') if(stack.empty()) return false; else if(stack.peek() == '{') stack.pop(); else return false; } return stack.empty(); }