C++ (Cpp) Solution::longestValidParentheses Examples

Example #1

File: [LeetCode]Longest Valid Parentheses.cpp Project: Callmedoby/ACM_LeetCode

int main(void){
	Solution answer;
	cout << answer.longestValidParentheses("(()()))") << endl;
	cout << answer.longestValidParentheses("(()((()())") << endl;
	cout << answer.longestValidParentheses(")()(()") << endl;
	system("Pause");
	return 0;
}

Example #2

File: 32_longest_valid_parentheses.cpp Project: hatlonely/leetcode

int main(int argc, const char *argv[]) {
    Solution solution;
    
    std::cout << solution.longestValidParentheses(")()()") << std::endl;
    std::cout << solution.longestValidParentheses("()()") << std::endl;
    std::cout << solution.longestValidParentheses("(()") << std::endl;
    
    return 0;
}

Example #3

File: LongestValidParentheses.cpp Project: johnnywsd/leetcode

int main() {
    Solution sol;
    cout << sol.longestValidParentheses("(()") << endl;
    cout << sol.longestValidParentheses("()()") << endl;
    cout << sol.longestValidParentheses("()(()") << endl;
    cout << sol.longestValidParentheses("(()()") << endl;
    cout << sol.longestValidParentheses("())()") << endl;
    cout << sol.longestValidParentheses(")()()") << endl;
    return 0;
}

Example #4

File: LongestValidParentheses.cpp Project: hiberabyss/octopress-blog

int main(int argc, char *argv[]) {
    Solution sol;
    {
        cout << sol.longestValidParentheses("()()") <<endl;
    }
    {
        cout << sol.longestValidParentheses("()(()") <<endl;
    }
    {
        cout << sol.longestValidParentheses(")(") <<endl;
    }
    return 0;
}

Example #5

File: 32_LongestValidParentheses.cpp Project: hujingqiu/LeetCode

int main() {
    Solution test;

    string s1 = "(()";
    cout << test.longestValidParentheses(s1) << endl;

    string s2 = ")()())";
    cout << test.longestValidParentheses(s2) << endl;

    string s3 = "()(())()()())((()))())((())()(())((()()()()(()()()))))))(()))()(())()(((()()(((()()()(((())))((())(()((()())())()(()(()(((())()()))())((())()(((())()()))))()(((()()))()()))(((()))(((())))())())(";
    cout << test.longestValidParentheses(s3) << endl;

    return 0;
}

Example #6

File: 32_LongestValidParentheses.cpp Project: GHScan/DailyProjects

int main() {
    Solution s;
    cout << s.longestValidParentheses("") << endl;
    cout << s.longestValidParentheses(")(") << endl;
    cout << s.longestValidParentheses("()(") << endl;
    cout << s.longestValidParentheses("())(") << endl;
    cout << s.longestValidParentheses("()") << endl;
    cout << s.longestValidParentheses(")()())") << endl;
    cout << s.longestValidParentheses("()((((()()()((()()") << endl;
    cout << s.longestValidParentheses(")()()(()()()))()") << endl;
    cout << s.longestValidParentheses("(()))((((())()()((()()()))()())") << endl;
}

Example #7

File: main.cpp Project: kevin2575/LeetCode

int main() {
	Solution s;
	int len = s.longestValidParentheses("(((()))))((()))");
	cout<<len<<endl;
	system("pause");
	return 0;
}

Example #8

File: LongestVP.cpp Project: mastertom/leetcode

int main()
{
    Solution SO;
    string s ="())";
    cout<<s<<endl;
    cout<<SO.longestValidParentheses(s);
}

Example #9

File: longest-valid-parentheses.cpp Project: siddontang/leetcode

int main() {
    Solution sln;

    cout << sln.longestValidParentheses("()(())") << endl;

    return 0;
}

Example #10

File: Longest_Valid_Parentheses.cpp Project: kennethhu418/LeetCode_Practice

int _tmain(int argc, _TCHAR* argv[])
{
    string s = ")((()))())(())())(";
    Solution so;
    so.longestValidParentheses(s);

	return 0;
}

Example #11

File: lc32.cpp Project: yuhc/LeetCode

int main() {
    Solution sol;
    string s;
    cin >> s;
    cout << sol.longestValidParentheses(s) << endl;

    return 0;
}

Example #12

File: longestValidParentheses2.cpp Project: weiyi-bitw/Leetcode

int main(){
	string s = "(((())(()(";
	Solution sol;
	cout << sol.longestValidParentheses(s) << endl;


	return 0;
}

Example #13

File: 32-Longest-Valid-Parentheses.cpp Project: michael1011101/Coding

int main()
{
    string str;
    cin >> str;
    Solution solution;
    cout << solution.longestValidParentheses(str) << endl;
    return 0;
}

Example #14

File: Longest Valid Parentheses.cpp Project: Yotta2/Leetcode

int main() {
    ofstream fout("sol.out");
    ifstream fin("sol.in");

    Solution sol;
    cout << sol.longestValidParentheses("(()") << endl;
    return 0;
}

Example #15

File: LongestValidParentheses.cpp Project: witwolf/leetcode

int main(int argc,char **argv){
    Solution s;
    while(true){
        string ss;
        cin >> ss;
        cout << ss << ":" << s.longestValidParentheses(ss) << endl;
    }
}

Example #16

File: LongestValidParentheseII.cpp Project: RyanWarm/ZUtils

int main() {
    Solution solution;
    string input = "())()()(())((()(()()(((()))((((())((()(())()())(()((((()))()(()))(())()(())(()(((((())((((((()())())(()(()((())()))(()))))))()(()))((((())()()()))()()()(((()(()())(()()(()(()()(((()))))))()()))())())((()()))))))((()))(((()((())()(()()))((())))()()())))))))()))))(()))))()))()))()((())))((()))(()))))))(((()))))))))()(()()()(())((())()))()()(())))()()))(()())()))(((()())()))((())((((()))(()(()(()()()(((())()(((((()))((()(((((())(()()))((((((((()(()(()(()(())))(())(()())())(()((((()(())((()(())))(())))()(((((()(()()(())))))))())(())(())(()()(((())))((()))(((((()))))())))()((()))()))))())))))((())(((((()()))((((())))(((()(()(())())(((()(()(()()()())))())()))((()((())())()()()(((())(((((()((((((()((()())))((((())((()(((((((()(()((()()()(()(()())(()(()()((((())))()(((()())))(()()))()(()()()()(((((())(()))))((()))())))()((((((()))())))()(()))(())))((((()())(((((()()())(((((())(()())(()))))()(()()))()))))))())))(((())(()(()()))(()))()(((())))())((((()(((()))))))()(()(()))()()(()()))))))))((()))))))(())((()((()))()))((((((()())))))(()((())((((()))))(()(()()()()(()))()()(()(()))(()()(((((((()())(())(()())((())())()(()())((())()())())(()())))())))(())())())(())((()())(((()()))()))()()))()(()(())((((((((())))()((())((()((((((((((()))))(()(((((())(()(()())())))((())())))))()))(()((()()))((()((())()()()((()(())())((())())(()()(((())))))())()()(()))()())(()(()((())))((((()()(())))())(())(()(()(())())())(()()())()(())())))(()()(((())))((()()(((())()()(()())((((()()(()())(()((((()(()()(()(()(((()((()())(()()))(()((((()(((((()))))()()))(((()((((((()(()()()()())()))(()(())))))((()(((()())())))(((()()))(()(()(((((((()()))(()(())))())()(())())(())(()))(())(()))()()(()()())))))()))()((())(((()((((((((())()()))())))((()())(";
    cout << input << endl;
    int result = solution.longestValidParentheses(input);
    cout << result << endl;
    return 1;
}

Example #17

File: Longest Valid Parentheses.cpp Project: printfchan/Leetcode

int main()
{
	//string s = ")()())()";
	//string s = ")()())()(()())))";
	string s = "()(()";
	Solution solution;
	cout << solution.longestValidParentheses(s);

	system("pause");
	return 0;
}

Example #18

File: 032_LongestValidParentheses.cpp Project: lingjiancong/Me

int main() {

	string s = ")()())()())";
	Solution solution;
	cout << solution.longestValidParentheses(s) << endl;
	Solution1 solution1;
	Solution2 solution2;
	cout << solution1.longestValidParentheses(s) << endl;
	//cout << solution2.longestValidParentheses(s) << endl;
	return 0;
}

Example #19

File: 32_LongestValidParentheses.cpp Project: lawenliu/CodeInterview

int main(void) {
	Solution *s = new Solution();
	string s1 = "(()";
	string s2 = ")()())";
	
	cout << "Solution 1: " << s->longestValidParentheses(s1) << endl;
	cout << "Solution 1: " << s->longestValidParentheses(s2) << endl;
	
	delete s;
	return 0;
}

Example #20

File: 32. Longest Valid Parentheses.cpp Project: gfreewind/LeetCodeSolutions

static void test_func(string &ss, int expect)
{
	Solution s;
	int ret = s.longestValidParentheses(ss);

	cout << "The longest parentheses of " << ss << "is " << ret;
	if (ret != expect) {
		cout << ", not expected!!!";
	}
	cout << endl;

}

Example #21

File: 32. Longest Valid Parentheses.cpp Project: Yeluorag/ACM-ICPC-Code-Library

int main() {
#ifdef LOCAL
    freopen("/Users/apple/input.txt","r",stdin);
    //	freopen("/Users/apple/out.txt","w",stdout);
#endif
	Solution cc;
	string s;
	cin >> s;
	cout << cc.longestValidParentheses(s) << endl;

	return 0;

}

Example #22

File: 412.cpp Project: githubmsj1/Leecode

int main()
{
	int src[][3]=
	{
	{9,9,0},
	{1,0,5},
	{2,5,6}
	};
	string start("hit");
	string end=("cog");
	string dict1[]={"hot","dot","dog","lot","log"};


	//s.ladderLength(start,end,dict);
	Solution s;
	cout<<s.longestValidParentheses("(()))())()()())()())(")<<endl;
	return 0;
}

Example #23

File: longestvalidparentheses.cpp Project: jxie418/leetcodecpp

int main() {
	Solution s;
        cout<<s.longestValidParentheses(")()())")<<endl;
	return 0;
}

Example #24

File: LongestValidParentheses.cpp Project: RobinWeng/leetcood

int main(){
	string s="()";
	Solution a;
	cout<<a.longestValidParentheses(s);
}

Example #25

File: LongestValidParentheses.cpp Project: hgfeaon/leetcode

int main() {
    Solution s;
    cout<<s.longestValidParentheses("()()")<<endl;
	system("pause");
	return 0;
}

Example #26

File: longest_valid_paren.cpp Project: draguraman/CompProg

int main(){
    Solution s;
    cout<<(s.longestValidParentheses("")==0)<<endl;
    cout<<(s.longestValidParentheses("(")==0)<<endl;
    cout<<(s.longestValidParentheses(")")==0)<<endl;
    cout<<(s.longestValidParentheses("))")==0)<<endl;
    cout<<(s.longestValidParentheses(")(")==0)<<endl;
    cout<<(s.longestValidParentheses("(()")==2)<<endl;
    cout<<(s.longestValidParentheses("(()()")==4)<<endl;
    cout<<(s.longestValidParentheses("(()())")==6)<<endl;
    cout<<(s.longestValidParentheses("(()()(")==4)<<endl;
    cout<<(s.longestValidParentheses("(())")==4)<<endl;
    cout<<(s.longestValidParentheses(")()")==2)<<endl;
    cout<<(s.longestValidParentheses(")())")==2)<<endl;
    cout<<(s.longestValidParentheses(")()()")==4)<<endl;
    cout<<(s.longestValidParentheses(")()()(")==4)<<endl;
    cout<<(s.longestValidParentheses(")()(())")==6)<<endl;
    cout<<(s.longestValidParentheses(")()(())()")==8)<<endl;
    cout<<(s.longestValidParentheses("(()))")==4)<<endl;
    cout<<(s.longestValidParentheses("(()")==2)<<endl;
    cout<<(s.longestValidParentheses("((())")==4)<<endl;
    cout<<(s.longestValidParentheses("()(")==2)<<endl;
    cout<<(s.longestValidParentheses("((()(")==2)<<endl;
    cout<<(s.longestValidParentheses("((()()")==4)<<endl;
    cout<<(s.longestValidParentheses("((()(()")==2)<<endl;
    cout<<(s.longestValidParentheses("()()))))()()(")==4)<<endl;
}

Example #27

File: 121.cpp Project: cyongli/code_bricker

int main(int argc, char *argv[]){
	Solution sol;
	string s(argv[1]);
	cout << sol.longestValidParentheses(s) << endl;
	return 0;
}

Example #28

File: longest_par.cpp Project: account-login/leetcode_cpp

                candidate = 0;
            }
        }
        ans = max(ans, candidate);

        return ans;
    }
};


#ifdef RUN_TEST
TEST_CASE("32. Longest Valid Parentheses") {
    Solution s;

    string str = "(()";
    CHECK(s.longestValidParentheses(str) == 2);
    CHECK(str == "(..");

    str = ")()())";
    CHECK(s.longestValidParentheses(str) == 4);
    CHECK(str == ")....)");

    str = ")(()()))";
    CHECK(s.longestValidParentheses(str) == 6);
    CHECK(str == ")......)");

    str = "))()()))((()))(()";
    CHECK(s.longestValidParentheses(str) == 6);
    CHECK(str == "))....))......(..");

    str = string(100000, '(') + string(100000, ')');

Example #29

File: 源.cpp Project: yuki252111/leetcode

int main() {
	Solution s;
	s.longestValidParentheses(")()())");
}

Example #30

File: 32.cpp Project: liuzhengzhe/leetcode

/*class Solution {
public:
    int c(char a){
        if(a=='('){
            return -1;
        }
        else if(a==')'){
            return 1;
        }
    }
    int longestValidParentheses(string s) {
        
        int ret=0;
        int len=s.length();
        int **dp=new int*[len];
        for(int i=0;i<len;i++){
            dp[i]=new int[len];
        }
        for(int i=0;i<len;i++){
            dp[i][i]=c(s[i]);
        }
        for(int i=0;i<len;i++){
            for(int j=i+1;j<len;j++){
                if(dp[i][j-1]==1 and c(s[j])==-1){
                    for(int x=j;x<len;x++){
                        dp[i][len-1]=1;
                    }
                  
                  break;
                }
                else{
                    dp[i][j]=dp[i][j-1]+c(s[j]);
                }
            }
        }
        for(int i=0;i<len;i++){
            for(int j=i+1;j<len;j++){
                if(dp[i][j]==0){
                    if(j-i>ret){
                        ret=j-i;
                    }
                }
                
            }
        }
        return ret;
        
    }
};*/
int main(){
    Solution s;
    s.longestValidParentheses(")()())()()(");
    return 0;
}