20.Valid Parentheses （括号匹配)

最新推荐文章于 2024-02-05 23:11:57 发布

原创最新推荐文章于 2024-02-05 23:11:57 发布 · 389 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

30 篇文章

订阅专栏

Stack&Queue

4 篇文章

订阅专栏

本文介绍了一种使用栈数据结构来验证括号是否正确配对的方法。该方法适用于包含圆括号'()',方括号'[]'及花括号'{}

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.

public class Solution {
public boolean isValid(String s) {
Stack<Character> charStack = new Stack<Character> ();
char [] a = s.toCharArray();
for(int i=0 ;i<s.length();i++){
char b = s.charAt(i);

if(a[i]=='('||a[i]=='['||a[i]=='{'){
charStack.push(a[i]);
}else{
if(charStack.isEmpty()) return false ;
if(b==')'&&charStack.peek()!='(') return false;
if(b==']'&&charStack.peek()!='[') return false;
if(b=='}'&&charStack.peek()!='{') return false;
charStack.pop();
}
}
return charStack.isEmpty();
}
}