leetcode 20 Valid Parentheses C++
2016-06-07 21:03
344 查看
这题只要把各种情况考虑全了就可以。
用栈实现。
bool isValid(string s) {
stack<char> st;
for(int i = 0;i<s.size();i++){
if(s[i] == '(' || s[i] == '{' || s[i] == '['){
st.push(s[i]);
}else{
if(!st.empty()){
if(st.top() == '(' && s[i] ==')'){
st.pop();
continue;
}else if(st.top() == '[' && s[i] ==']'){
st.pop();
continue;
}else if(st.top() == '{' && s[i] =='}'){
st.pop();
continue;
}else{
return false;
}
}else{
return false;
}
}
}
if(st.empty()) return true;
else return false;
}
用栈实现。
bool isValid(string s) {
stack<char> st;
for(int i = 0;i<s.size();i++){
if(s[i] == '(' || s[i] == '{' || s[i] == '['){
st.push(s[i]);
}else{
if(!st.empty()){
if(st.top() == '(' && s[i] ==')'){
st.pop();
continue;
}else if(st.top() == '[' && s[i] ==']'){
st.pop();
continue;
}else if(st.top() == '{' && s[i] =='}'){
st.pop();
continue;
}else{
return false;
}
}else{
return false;
}
}
}
if(st.empty()) return true;
else return false;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解