我的LeetCode代码仓:https://github.com/617076674/LeetCode
原题链接:https://leetcode-cn.com/problems/valid-parentheses/description/
题目描述:
知识点:栈
思路:利用栈的后入先出性质来匹配括号
依次遍历输入字符串s中的每一个字符,如果是左括号,直接入栈。如果是右括号,栈顶元素出栈,并判断能否与该右括号匹配,不能匹配直接返回false。最后遍历完字符串s后我们要保证我们的栈是一个空栈。如果不是空栈,对应“{[]”这种情形,是无效字符串。
时间复杂度是O(n),其中n为字符串s的长度。空间复杂度是O(n)。
JAVA代码:
public class Solution {
public boolean isValid(String s) {
Stack<Character> stack = new Stack<>();
for(int i = 0; i < s.length(); i++) {
Character character1 = s.charAt(i);
if(character1 == '(' || character1 == '[' || character1 == '{') {
stack.push(character1);
}else if(character1 == ')') {
if(stack.isEmpty()) {
return false;
}
Character character2 = stack.pop();
if(character2 != '(') {
return false;
}
}else if(character1 == ']') {
if(stack.isEmpty()) {
return false;
}
Character character2 = stack.pop();
if(character2 != '[') {
return false;
}
}else if(character1 == '}') {
if(stack.isEmpty()) {
return false;
}
Character character2 = stack.pop();
if(character2 != '{') {
return false;
}
}
}
return stack.isEmpty();
}
}
LeetCode解题报告: