代码拉取完成,页面将自动刷新
同步操作将从 doocs/leetcode 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
Given a string s
containing just the characters '('
, ')'
, '{'
, '}'
, '['
and ']'
, determine if the input string is valid.
An input string is valid if:
Example 1:
Input: s = "()" Output: true
Example 2:
Input: s = "()[]{}" Output: true
Example 3:
Input: s = "(]" Output: false
Example 4:
Input: s = "([)]" Output: false
Example 5:
Input: s = "{[]}" Output: true
Constraints:
1 <= s.length <= 104
s
consists of parentheses only '()[]{}'
.class Solution:
def isValid(self, s: str) -> bool:
q = []
parentheses = {'()', '[]', '{}'}
for ch in s:
if ch in '([{':
q.append(ch)
elif not q or q.pop() + ch not in parentheses:
return False
return not q
class Solution {
public boolean isValid(String s) {
char[] chars = s.toCharArray();
Deque<Character> q = new ArrayDeque<>();
for (char ch : chars) {
boolean left = ch == '(' || ch == '[' || ch == '{';
if (left) q.push(ch);
else if (q.isEmpty() || !match(q.pop(), ch)) return false;
}
return q.isEmpty();
}
private boolean match(char l, char r) {
return (l == '(' && r == ')') || (l == '{' && r == '}') || (l == '[' && r == ']');
}
}
class Solution {
public:
bool isValid(string s) {
stack<char> q;
for (int i = 0, n = s.length(); i < n; ++i) {
if (s[i] == '{' || s[i] == '[' || s[i] == '(') q.push(s[i]);
else if (q.empty() || !match(q.top(), s[i])) return false;
else q.pop();
}
return q.empty();
}
private:
bool match(char l, char r) {
return (l == '(' && r == ')') || (l == '[' && r == ']') || (l == '{' && r == '}');
}
};
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。