C++ (Cpp) Solution::longestPalindrome Examples

Example #1

File: longest_palindromic_substring.cpp Project: erickingcs/algorithm

int main(int argc, char *argv[])
{
    Solution sol;
    Solution2 sol2;
    Solution3 sol3;
    string s1;
    string s2("a");
    string s3("aba");
    string s4("abcc");

    cout << sol.longestPalindrome(s1) << endl;
    cout << sol.longestPalindrome(s2) << endl;
    cout << sol.longestPalindrome(s3) << endl;
    cout << sol.longestPalindrome(s4) << endl;

    cout << sol2.longestPalindrome(s1) << endl;
    cout << sol2.longestPalindrome(s2) << endl;
    cout << sol2.longestPalindrome(s3) << endl;
    cout << sol2.longestPalindrome(s4) << endl;

    cout << sol3.longestPalindrome(s1) << endl;
    cout << sol3.longestPalindrome(s2) << endl;
    cout << sol3.longestPalindrome(s3) << endl;
    cout << sol3.longestPalindrome(s4) << endl;

    return 0;
}

Example #2

File: sol.cpp Project: huicpc0215/AlgorithmCode

int main()
{
    Solution S;
    cout<<S.longestPalindrome("abcb")<<endl;
    cout<<S.longestPalindrome("aaaab")<<endl;
    return 0;
}

Example #3

File: main.cpp Project: wenxin-wang/leetcode-answer

int main() {
  Solution s;
  cout << s.longestPalindrome("ab") << endl;
  cout << s.longestPalindrome("aba") << endl;
  cout << s.longestPalindrome("aaaa") << endl;
  cout << s.longestPalindrome("ababa") << endl;
  cout << s.longestPalindrome("cababa") << endl;
  return 0;
}

Example #4

File: LongestPalindromicSubstring.cpp Project: TomeC/leetCode

// test case
int main()
{
    string str = "abacdfgdcaba";
    Solution s;
    cout <<  str << " : " << s.longestPalindrome(str) << endl;

    str = "abbaccabba";
    cout <<  str << " : " << s.longestPalindrome(str) << endl;
    return 0;
}

Example #5

File: longest-palindromic-substring.cpp Project: samertufail/algorithms

void runTests()
{
    Solution s;
    assert("abbba" == s.longestPalindrome("adcarrabbba"));
    assert("abbba" == s.longestPalindrome("bbcarraabbba"));
    assert("bbbbb" == s.longestPalindrome("bbbbb"));

    assert("rrarr" == s.longestPalindromeOp1("arrarr"));
    assert("abbba" == s.longestPalindromeOp1("adcarrabbba"));
    assert("abbba" == s.longestPalindromeOp1("bbcarraabbba"));
    assert("bbbbb" == s.longestPalindromeOp1("bbbbb"));
}

Example #6

File: LongestPalindromicSubstring.cpp Project: Raynxxx/LeetCode

int main() {
    Solution solution;
    auto ret = solution.longestPalindrome("aba");
    assert(ret == "aba");
    ret = solution.longestPalindrome("jqcabacd");
    assert(ret == "cabac");
    ret = solution.longestPalindrome("jqcabbacd");
    assert(ret == "cabbac");
    ret = solution.longestPalindrome("");
    assert(ret == "");
    ret = solution.longestPalindrome("a");
    assert(ret == "a");
    return 0;
}

Example #7

File: LongestPalindromicSubstring.cpp Project: hujingqiu/LeetCode

int main() {
    Solution test;
    string s1 = "abba";
    string s2 = "abcd";
    string s3 = "abcdcb";

    string ans1 = test.longestPalindrome(s1);
    string ans2 = test.longestPalindrome(s2);
    string ans3 = test.longestPalindrome(s3);

    cout << ans1 << endl << ans2 << endl << ans3 << endl;

    return 0;
}

Example #8

File: longest-palindromic-substring.cpp Project: Ronald-Liu/ronald-leetcode

int main()
{
    Solution s;
    string t = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabcaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa";
    cout << s.longestPalindrome(t) << endl;
    return 0;
}

Example #9

File: ans.cpp Project: seedChen/leetcode

int main(int argc, char *argv[])
{
    string exam("ababbbbaaacccabbaccc");
    Solution s;
    cout << s.longestPalindrome(exam) << endl;;
    return 0;
}

Example #10

File: 005_longest_palindromic_string.cpp Project: largetalk/leetcode

int main(int argc, const char * argv[]) {
    Solution s = Solution();

    //cout << s.longestPalindrome("babad") << '\n';
    //cout << s.longestPalindrome("") << '\n';
    cout << s.longestPalindrome("abb") << '\n';
}

Example #11

File: longest_palindromic_2.cpp Project: bigning/leetcode

int main() {
    string str = "bananas";
    Solution s;
    string res = s.longestPalindrome(str);
    std::cout << res << std::endl;
    return 0;
}

Example #12

File: longest_palindromic_substring.cpp Project: kaushikacharya/cpp_practise

int main(int argc, char* argv[])
{
    string str = "1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111";
    Solution sln;
    cout << sln.longestPalindrome(str) << endl;
    return 0;
}

Example #13

File: 409.cpp Project: JetMuffin/algorithm

int main() {
    Solution s;
    string ss;
    while(cin>>ss) {
        cout<<s.longestPalindrome(ss)<<endl;
    }
}

Example #14

File: LongestPalindromicSubstring.cpp Project: Andrew-liu/Leetcode

int main(int argc, const char *argv[])
{
    string test = "aba";
    Solution s;
    cout << s.longestPalindrome(test) << endl;
    return 0;
}

Example #15

File: LongestPalindromicSubstring.cpp Project: zoeeer/LeetCode

int main()
{
    string s;
    Solution ans;
    while (cin >> s)
        cout << ans.longestPalindrome(s) << endl;
}

Example #16

File: longest_palindromic_substring.cpp Project: B-Rich/leetcode

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

Example #17

File: main.cpp Project: paulnewman1979/edocteel

int main(int argc, char* argv[])
{
    string value;
    cin >> value;
    Solution solution;
    cout << solution.longestPalindrome(value) << endl;
}

Example #18

File: 007.Longest.Palindromic.Substring.2.cpp Project: jiabailie/Algorithm

int main()
{
	Solution sol;
	string l = sol.longestPalindrome(string("aaabaaaa"));
	cout << l.c_str() << endl;
	return 0;
}

Example #19

File: 5-Longest-Palindromic-Substring.cpp Project: zhubo240/leetcode

int main(int argc, char **argv) {
	Solution s;
	string res = s.longestPalindrome("aaaa");
	cout << res << endl;
	std::cout << "main over" << std::endl;
	return 0;
}

Example #20

File: 5-Longest Palindromic Substring.cpp Project: gfreewind/LeetCodeSolutions

static void test_func(string str)
{
	Solution s;
	string max = s.longestPalindrome(str);

	cout << str << ": " << max << endl;
}

Example #21

File: LongestPalindrome.cpp Project: ZhenyingZhu/CppAlgorithms

int main() {
    Solution sol;

    //cout << sol.longestPalindrome() << endl;
    cout << sol.longestPalindrome("abccccdd") << endl;

    return 0;
}

Example #22

File: leetcode#5.cpp Project: binghe2001021/leetcode

int main()
{
	string t = "acbbca";
	Solution s;
	string ans = s.longestPalindrome(t);
	cout << ans;
	system("pause");
}

Example #23

File: Longest Palindromic Substring.cpp Project: run/algorithms

int main()
{
	Solution sol;
	string s = "civilwarranynartiWravelmenlivi";
	cout << "max palidrome = " << sol.longestPalindrome(s) << endl;

	return 0;
}

Example #24

File: 00409. Longest Palindrome.cpp Project: 778477/LeetCode

int main(){
    
    Solution solve;
    cout<<solve.longestPalindrome("civilwartestingwhetherthatnaptionoranynartionsoconceivedandsodedicatedcanlongendureWeareqmetonagreatbattlefiemldoftzhatwarWehavecometodedicpateaportionofthatfieldasafinalrestingplaceforthosewhoheregavetheirlivesthatthatnationmightliveItisaltogetherfangandproperthatweshoulddothisButinalargersensewecannotdedicatewecannotconsecratewecannothallowthisgroundThebravelmenlivinganddeadwhostruggledherehaveconsecrateditfaraboveourpoorponwertoaddordetractTgheworldadswfilllittlenotlenorlongrememberwhatwesayherebutitcanneverforgetwhattheydidhereItisforusthelivingrathertobededicatedheretotheulnfinishedworkwhichtheywhofoughtherehavethusfarsonoblyadvancedItisratherforustobeherededicatedtothegreattdafskremainingbeforeusthatfromthesehonoreddeadwetakeincreaseddevotiontothatcauseforwhichtheygavethelastpfullmeasureofdevotionthatweherehighlyresolvethatthesedeadshallnothavediedinvainthatthisnationunsderGodshallhaveanewbirthoffreedomandthatgovernmentofthepeoplebythepeopleforthepeopleshallnotperishfromtheearth")<<endl;
    
    
    return 0;
}

Example #25

File: longestPalindromeSubstring.cpp Project: arnabgho/competitive_programming

int main(){
    Solution s;
   // string check="aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabcaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa";
    string check="aaaabbbbbbbbbbccccccccccddddddddddeeeeeeeeeeffffffffffgggggggggghhhhhhhhhhiiiiiiiiiijjjjjjjjjjkkkkkkkkkkllllllllllmmmmmmmmmmnnnnnnnnnnooooooooooppppppppppqqqqqqqqqqrrrrrrrrrrssssssssssttttttttttuuuuuuuuuuvvvvvvvvvvwwwwwwwwwwxxxxxxxxxxyyyyyyyyyyzzzzzzzzzzyyyyyyyyyyxxxxxxxxxxwwwwwwwwwwvvvvvvvvvvuuuuuuuuuuttttttttttssssssssssrrrrrrrrrrqqqqqqqqqqppppppppppoooooooooonnnnnnnnnnmmmmmmmmmmllllllllllkkkkkkkkkkjjjjjjjjjjiiiiiiiiiihhhhhhhhhhggggggggggffffffffffeeeeeeeeeeddddddddddccccccccccbbbbbbbbbbaaaaaaaabbbbbbbbbbccccccccccddddddddddeeeeeeeeeeffffffffffgggggggggghhhhhhhhhhiiiiiiiiiijjjjjjjjjjkkkkkkkkkkllllllllllmmmmmmmmmmnnnnnnnnnnooooooooooppppppppppqqqqqqqqqqrrrrrrrrrrssssssssssttttttttttuuuuuuuuuuvvvvvvvvvvwwwwwwwwwwxxxxxxxxxxyyyyyyyyyyzzzzzzzzzzyyyyyyyyyyxxxxxxxxxxwwwwwwwwwwvvvvvvvvvvuuuuuuuuuuttttttttttssssssssssrrrrrrrrrrqqqqqqqqqqppppppppppoooooooooonnnnnnnnnnmmmmmmmmmmllllllllllkkkkkkkkkkjjjjjjjjjjiiiiiiiiiihhhhhhhhhhggggggggggffffffffffeeeeeeeeeeddddddddddccccccccccbbbbbbbbbbaaaa";
    cout<<s.longestPalindrome(check);
    cout<<endl;
    return 0;
}

Example #26

File: longestPalindromicSubstring.cpp Project: adairjun/leetcode

int main(int argc,char** argv)
{
	string s = "abcdefghijklmnopqqporst";                                              //最长回文串是opqpo
	Solution solve;
	string result = solve.longestPalindrome(s);
	cout<<"the result is -----------------"<<result<<endl;
	return 0;
}

Example #27

File: AC_manacher_n.cpp Project: 0TK0/leetcode

int main() {
    Solution s;
    string str;
    while (cin >> str) {
        cout << s.longestPalindrome(str) << endl;
    }
    return 0;
}

Example #28

File: longestPstring.cpp Project: zkmake520/Algorithms

int main(){
    
    Solution sol;
    // cout<<2<<endl;
    string ans = sol.longestPalindrome("aaa");
    cout<<ans;
    
}

Example #29

int main()
{
    Solution s;
    string ret;
    string str = "IIIOOOIII";

    ret = s.longestPalindrome(str);
    cout << ret << endl;
}

Example #30

File: test.cpp Project: sniperswang/dev

int main() 
{
	//string str="ccd";
	string str="abcdefghiabbajhg";
	Solution s;
	cout << s.longestPalindrome(str) << endl;

    return 0;
}