LeetCode9. 回文数

LeetCode9. 回文数

class Solution {
public:
  bool isPalindrome(int x) {
    if (x < 0) return false;
    vector<int>s;
    while (x) {
      s.emplace_back(x % 10);
      x /= 10;
    }
    for (int i = 0, j = s.size() - 1; i < j; i++, j--) 
      if (s[i] != s[j]) return false;
    return true;
  }
};