-
Notifications
You must be signed in to change notification settings - Fork 0
/
Leetcode Problem 9 Palindrome.txt
51 lines (40 loc) · 1.07 KB
/
Leetcode Problem 9 Palindrome.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
9. Palindrome Number
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?
Hint: Reverse thed digits by getting the unit digit and adding to the previous by multiplying 10
Language: C#
public class Solution {
public bool IsPalindrome(int x)
{
if(x < 0)
return false;
int input = x;
int reversed = 0;
while(x!=0)
{
int unitDigit = x%10;
reversed = reversed*10 + unitDigit;
x = x/10;
}
if(reversed == input)
{
return true;
}
else
{
return false;
}
}
}