C++ (Cpp) Solution::isPalindrome Examples

Example #1

File: palindrome_number_9.cpp Project: dandanJing/leetcode

void let_9(){
	Solution sol;
	cout<<sol.isPalindrome(-2147483648)<<endl;
	cout<<sol.isPalindrome(-321)<<endl;
	cout<<sol.isPalindrome(100)<<endl;
	cout<<sol.isPalindrome(12321)<<endl;
}

Example #2

File: sol.cpp Project: huicpc0215/AlgorithmCode

int main(){
    Solution S;
    cout<<S.isPalindrome(21312)<<endl;
    cout<<S.isPalindrome(456)<<endl;
    cout<<S.isPalindrome(-1)<<endl;
    return 0;
}

Example #3

File: PalindromeNumber.cpp Project: suzhiyang/leetcode

int main()
{
    Solution s;
    cout<<s.isPalindrome(10021)<<endl;
    cout<<s.isPalindrome(121)<<endl;
    cout<<s.isPalindrome(1000000001)<<endl;
}

Example #4

File: solution125.cpp Project: cpselvis/leetcode

int main(int argc, char **argv)
{
  Solution s;
  cout << s.isPalindrome("A man, a plan, a canal: Panama") << endl;
  cout << s.isPalindrome("race a car") << endl;
  cout << s.isPalindrome(".,") << endl;
}

Example #5

File: torresng.cpp Project: nothingbutu/LeetCode

int main(void) {
	Solution s = Solution();
    cout << "121: " << boolalpha << s.isPalindrome(121) << endl;
    cout << "-121: " << boolalpha << s.isPalindrome(-121) << endl;
    cout << "10: " << boolalpha << s.isPalindrome(10) << endl;

	return 0;
}

Example #6

File: valid_palindrome.cpp Project: justinj656/oj-leetcode

int main() {
  string str = "A man, a plan, a canal: Panama";
  string str1 = "   a         a    ";
  Solution s;
  cout<<s.isPalindrome(str)<<endl;
  cout<<s.isPalindrome(str1)<<endl;
  return 0;
}

Example #7

File: PalindromeNumber.cpp Project: monitor1379/LeetCode

int main() {
    Solution s;
    cout << s.isPalindrome(121) << endl;
    cout << s.isPalindrome(12321) << endl;
    cout << s.isPalindrome(1) << endl;
    cout << s.isPalindrome(0) << endl;
    cout << s.isPalindrome(-1) << endl;
    return 0;
}

Example #8

File: main.cpp Project: betallcoffee/leetcode

int main(int argc, const char * argv[]) {
    Solution s;
    
    cout << s.isPalindrome(0) << endl;
    
    cout << s.isPalindrome(123321) << endl;
    
    return 0;
}

Example #9

File: palindrome-number.cpp Project: AndreMouche/algorithm-solution

int main(){
	Solution sol ;
	cout << sol.isPalindrome( 1000 )  << endl;
	cout << sol.isPalindrome( 1 )  << endl;
	cout << sol.isPalindrome( 11 )  << endl;
	cout << sol.isPalindrome( 121 )  << endl;
	cout << sol.isPalindrome( 125 )  << endl;
	cout << sol.isPalindrome( 52125 )  << endl;
	return 0 ;
}

Example #10

File: main.cpp Project: allenwhc/Leetcode

void main(int argc, char* argv[]){
	string s1 = "A man, a plan, a canal: Panama";
	string s2 = " apG0i4maAs::sA0m4i0Gp0";
	Solution s;
	if (s.isPalindrome(s1) && s.isPalindrome(s2)) cout << "'" << s1 << "' and '" << s2 << "' are both palindrome." << endl;
	if (s.isPalindrome(s1) && !s.isPalindrome(s2)) cout << "'" << s1 << "' is palindrome, while '" << s2 << "' is not." << endl;
	if (!s.isPalindrome(s1) && s.isPalindrome(s2)) cout << "'" << s2 << "' is palindrome, while '" << s1 << "' is not." << endl;
	if (!s.isPalindrome(s1) && !s.isPalindrome(s2)) cout << "Neither '" << s1 << "' nor '" << s2 << "' is palindrome." << endl;
	system("pause");
}

Example #11

File: Is_integer_palindrome.cpp Project: wangshiy/cc

int main()
{
    Solution s;
    printf("%d is %d\n", 0, s.isPalindrome(0) );
    printf("%d is %d\n", -101, s.isPalindrome(-101) );
    printf("%d is %d\n", 1001, s.isPalindrome(1001) );
    printf("%d is %d\n", 1234321, s.isPalindrome(1234321) );
    printf("%d is %d\n", 2147447412, s.isPalindrome(2147447412) );
    printf("%d is %d\n", 2142, s.isPalindrome(2142) );
}

Example #12

File: ValidPalindrome.cpp Project: monitor1379/LeetCode

int main() {
    Solution s;
    cout << s.isPalindrome("A man, a plan, a canal: Panama") << endl;
    cout << s.isPalindrome("race a car") << endl;
    cout << s.isPalindrome("") << endl;
    cout << s.isPalindrome("a.") << endl;
    cout << s.isPalindrome("ab") << endl;
    cout << s.isPalindrome("0p") << endl;

    return 0;
}

Example #13

File: ans.cpp Project: isszombie/Trainning

int main()
{
	string s,r="A man, a plan, a canal: Panama";
	Solution sol;
	if(!(sol.isPalindrome(r)))
	{
		cout<<"WRONG ANSWER"<<endl;
	}
	while(getline(cin,s))
	{
		cout<<sol.isPalindrome(s)<<endl;
	}
}

Example #14

File: ValidPalindrome.cpp Project: physician/LeetCode

int main() {
    Solution sol;
    string s1 = "A man, a plan, a canal: Panama";
    string s2 = "race a car";
    if(sol.isPalindrome(s1))
        cout << "String s1 (" << s1 << "): is palindrome." << endl;
    else
        cout << "String s1 (" << s1 << "): is NOT palindrome." << endl;
    if(sol.isPalindrome(s2))
        cout << "String s2 (" << s2 << "): is palindrome." << endl;
    else
        cout << "String s2 (" << s2 << "): is NOT palindrome." << endl;

}

Example #15

File: palindromeNumber.cpp Project: Evanqiao/LeetCode-qyh

int main()
{
	Solution solution;
	int x = -12;
	int x2 = 232;
	int x3 = 455;
	int x4 = 879978;
	std::cout << "-12 :" << solution.isPalindrome(x) << std::endl;
	std::cout << "232 :" << solution.isPalindrome(x2) << std::endl;
	std::cout << "455 :" << solution.isPalindrome(x3) << std::endl;
	std::cout << "879978 :" << solution.isPalindrome(x4) << std::endl;
	
	
}

Example #16

File: 9-PalinNum.cpp Project: ice-tea/LeetCode

int main() {
    Solution s;
    if(s.isPalindrome(1000000001))
        printf("yes!");
    else
        printf("no!");
}

Example #17

File: 125isPalindrome.cpp Project: Morainy/LeetCode

int main(int argc , char* argv[])
{
	//string str("A man, a plan, a canal: Panama");
	string str("1a2");
	Solution sol;
	cout<<"res = "<<sol.isPalindrome(str)<<endl;
}

Example #18

File: main.cpp Project: 540485909/leetcode

int main()
{
    ListNode *l1=new ListNode(1);
     ListNode *l2=new ListNode(2);


    /*  ListNode *l3=new ListNode(5);

       ListNode *l4=new ListNode(4);

        ListNode *l5=new ListNode(5);

        ListNode *l6=new ListNode(4);

        ListNode *l7=new ListNode(3);

        ListNode *l8=new ListNode(2);

         ListNode *l9=new ListNode(1);
           l1->next=l2;l2->next=l3;l3->next=l4;l4->next=l5;l5->next=l6;l6->next=l7;l7->next=l8;l8->next=l9;*/
           l1->next=l2;
         Solution s;
        cout<< s.isPalindrome(l1);

    return 0;
}

Example #19

File: valid-palindrome.cpp Project: AlvinTech/LeetCode

int main(int argc, char const *argv[])
{
	Solution s;
	bool result = s.isPalindrome("`l;`` 1o1 ??;l`");
	printf("%s\n", result ? "true":"false" );
	return 0;
}

Example #20

File: AC_simulation_n.cpp Project: 0TK0/leetcode

int main() {
    Solution a;
    int x;
    while (cin >> x)
        cout << a.isPalindrome(x) << endl;
    return 0;
}

Example #21

File: PalindromeNumber___009(AC).cpp Project: cqf1991/LeetCode

int main()
{
	int a =0;
	Solution pal;
	cout << pal.isPalindrome(a) << endl;
	return 0;
}

Example #22

File: main.cpp Project: lxyzk/LeetCodeOJ

int main(int argc, const char * argv[])
{
    string s("race a car");
    Solution solution;
    cout<<solution.isPalindrome(s)<<endl;
    return 0;
}

Example #23

File: valid_palindrome.cpp Project: amulya349/codingskill-1

void honglei(string s) {
    cout << "\"" << s << "\" ";
    static Solution solve;
    if (solve.isPalindrome(s))
        cout << "is a palindrome" << endl;
    else cout << "is not a palindrome" << endl;
}

Example #24

File: valid_palindrome.cpp Project: wjqmichael/workspace

int main() {
  Solution s;
  cout << isalnum('.') << endl;
  cout << isalnum(',') << endl;
  cout << s.isPalindrome("a.b,.") << endl;
  return 0;
}

Example #25

File: main.cpp Project: LeungGeorge/leetcode

int main()
{
    vector<int> nums1;
    vector<int> nums2;
    // 当中位数为两个时,取其平均值.
    /*for(int i = 0; i < 1000000; i++)
    {
        if (i&0x1)
            nums1.push_back(i);
        else 
            nums2.push_back(i);
    }*/
    nums1.push_back(1);
    nums1.push_back(2);
    nums1.push_back(3);
    nums2.push_back(1);

    StopWatch sw;
    
    Solution ss;

    bool rrr = ss.isPalindrome(12321);
    sw.start();
    double i = ss.findMedianSortedArrays_2(nums1, nums2);
    double sec = sw.seconds();
    setprecision(20);
    std::cout << "ct: " << i << std::endl 
        << "seconds: " << sec << std::endl;
    return 0;
}

Example #26

File: isPalindrome.cpp Project: jianmingwu/leetcode

int main()
{
    Solution s;

    cout << s.isPalindrome(-10) << endl;
    return 0;
}

Example #27

File: PalindromeNumber.cpp Project: Qzhenlong/LeetCode

int main()
{
  Solution c;
  cout << (c.isPalindrome(-2147483648) ? "true" : "false") << endl;
  while(1);
  return 1;   
}

Example #28

File: lint415.cpp Project: dominjune/OJ

int main()
{
	string s = "ab";
	Solution sol;
	cout << sol.isPalindrome(s) << endl;
	return 0;
}

Example #29

File: validPalindrome.cpp Project: seuzl/myleetcode

int main() {
    string test = "A man, a plan, a canal: Panama";

    Solution sol;
    cout << sol.isPalindrome(test) << endl;
    return 0;
}

Example #30

File: main.cpp Project: LeetCodeLearn/Palindrome_Number

int main(int argc, const char * argv[])
{
    Solution* so = new Solution;
    printf("%d",so->isPalindrome(1232321));
    delete so;
    return 0;
}