zoukankan      html  css  js  c++  java
  • [leetcode]9. Palindrome Number

    9. Palindrome Number (c++)

    Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

    Example 1:

    Input: 121
    Output: true
    

    Example 2:

    Input: -121
    Output: false
    Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
    

    Example 3:

    Input: 10
    Output: false
    Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
    

    Follow up:

    Coud you solve it without converting the integer to a string?
    

    题意:判断回文数字。不使用回文串方法。

    思路:新建,赋值,判断….

    class Solution
    {
    public:
      bool isPalindrome(int x)
      {
        int a = 0, b = x;
        while (b>0)
        {
          a = a * 10 + b % 10;
          b = b / 10;
        }
        cout << a << b << endl;
        return a == x ? 1 : 0;
      }
    };
  • 相关阅读:
    抓老鼠啊~亏了还是赚了?
    币值转换
    打印沙漏
    秋季学期学习总结
    PTA币值转化
    PTA作业
    秋季学习总结
    人生最重要的3个老师
    自我介绍
    vue入门(二) 让axios发送表单形式数据
  • 原文地址:https://www.cnblogs.com/ruoh3kou/p/9893462.html
Copyright © 2011-2022 走看看