-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path9.palindrome-number.go
59 lines (58 loc) · 1005 Bytes
/
9.palindrome-number.go
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
52
53
54
55
56
57
58
/*
* @lc app=leetcode id=9 lang=golang
*
* [9] Palindrome Number
*
* https://leetcode.com/problems/palindrome-number/description/
*
* algorithms
* Easy (42.18%)
* Total Accepted: 523.6K
* Total Submissions: 1.2M
* Testcase Example: '121'
*
* 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?
*
*/
func isPalindrome(x int) bool {
if x < 0 {
return false
}
o := x
rev := 0
for x != 0 {
rev = rev*10 + x%10
x = x / 10
}
return rev == o
}