您的位置:首页 > 其它

LeetCode – Refresh – Longest Valid Parentheses

2015-03-20 08:09 495 查看
Notes:

Do not forget to clean the total and rec.

class Solution {
public:
int longestValidParentheses(string s) {
int len = s.size(), total = 0, rec = 0, result = 0;
for (int i = 0; i < len; i++) {
if (s[i] == '(') {
total++;
rec++;
} else {
total++;
rec--;
}
if (rec < 0) {
total = 0;
rec = 0;
} else if (rec == 0) {
result = max(result, total);
}
}
total = 0, rec = 0;
for (int i = len-1; i >= 0; i--) {
if (s[i] == ')') {
total++;
rec++;
} else {
total++;
rec--;
}
if (rec < 0) {
total = 0;
rec = 0;
} else if (rec == 0) {
result = max(result, total);
}
}
return result;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: