LeetCode Daily 2 Questions 02: Number of Palindromes (1200 each)

• Solution idea: first convert the integer type to string type, and then traverse, the array length/2 because the palindrome dates are in reverse order, the first digit and the penultimate digit are equal, the second digit and the penultimate digitThe two digits are equal, and so on, if they are not equal, return false, if they are equal, return true

class Solution {public boolean isPalindrome(int x) {String str = x + "";//1221 runs twicefor (int i = 0; i <str.length() / 2; i++) {if (str.charAt(i) != str.charAt(str.length() - 1 - i)) {Subtract one because it starts from 0 instead of 1 return false;}}return true;}}