LeetCode 9. Palindrome Number C++/Java

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?
更进一步：
你能不使用string类解决这个问题吗?

C++实现

class Solution {
public:
    bool isPalindrome(int x) {
        string s = to_string(x);
        std::reverse(s.begin(),s.end());
        if(s==to_string(x)) return true;
        else return false;
    }
};

Java

class Solution {
    public boolean isPalindrome(int x) {
        String s = String.valueOf(x);
        for(int i = 0, j = s.length() - 1; i < j ; i++, j--){
            if(s.charAt(i) != s.charAt(j)){
                return false;
            }
        }
        return true;
    }
}

小结：做的时候没看到最后一行"Coud you solve it without converting the integer to a string?"。。。。。