π©9. Palindrome Number
Given an integer x
, return true
if x
is a
palindrome, and false
otherwise.
Example 1:
Input: x = 121
Output: true
Explanation: 121 reads as 121 from left to right and from right to left.
Example 2:
Input: x = -121
Output: false
Explanation: From left to right, it reads -121. it is not a palindrome.
Example 3:
Input: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
bool isPalindrome(int x)
{
string original = to_string(x); // ΠΊΠΎΠ½Π²Π΅ΡΡΠΈΡΡΠ΅ΠΌ int Π² ΡΡΡΠΎΠΊΡ
string reverse;
for(int i = original.size()-1; i<original.size(); i--) // ΡΠΎΠ·Π΄Π°Π΅ΠΌ ΠΈΠ½Π²Π΅ΡΡΠΈΠ²Π½ΡΡ ΡΡΡΠΎΠΊΡ
{
reverse = reverse + original[i];
if(original[i] == '\0')
{
break;
}
}
if(reverse == original) // ΡΡΠ°Π²Π½ΠΈΠ²Π°Π΅ΠΌ ΠΈΠ½Π²Π΅ΡΡΠΈΠ²Π½ΡΡ ΡΡΡΠΎΠΊΡ Ρ ΠΎΡΠΈΠ³ΠΈΠ½Π°Π»ΠΎΠΌ
{
return true;
}
return false;
}
Last updated