题目
Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Note that an empty string is also considered valid.
Example 1: Input: “()” Output: true
Example 2: Input: “()[]{}” Output: true
Example 3: Input: “(]” Output: false
Example 4: Input: “([)]” Output: false
Example 5: Input: “{[]}” Output: true
程序
解题思路:
- 利用栈的数据结构,将左括号放入栈中,遇到右括号,则弹出栈的最顶上元素,配对则消失,否则返回false;
- 可以利用vector实现上述功能,可利用函数包括:
vector.back():返回向量中最后一个元素;
vector.pop_back():删除向量中最后一个元素;
vector.push_back():将括号中的对象添加到向量中去;
vector.empty():判断向量是否为空;
class Solution {
public:
bool isValid(string s) {
int i = 0;
char ch;
vector<char> c;
if(s == "") return true;
for(i = 0; i < s.size(); i++){
if(s[i] == ')' || s[i] == '}' || s[i] == ']'){
if(c.empty()) return false;
else
ch = c.back();
switch (s[i]){
case ')':{
if(ch != '(') return false;
else
c.pop_back();
break;
}
case '}':{
if(ch != '{') return false;
else
c.pop_back();
break;
}
case ']':{
if (ch != '[') return false;
else
c.pop_back();
break;
}
}
}
else
c.push_back(s[i]);
}
if(c.empty())
return true;
else
return false;
}
};
分析
- 时间复杂度O(s),s是字符串的长度;空间复杂度O(s)
错误
- 错误使用vector的操作;
- switch语法不熟;