[LeetCode] 7. Reverse Integer [Easy] [LeetCode]
Given a 32-bit signed integer, reverse digits of an integer.
Example 1:
Example 2:
Example 3:
Note: Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
Analyse:
利用數學方法反轉.
Solution:
Previous[LeetCode] 5. Longest Palindromic Substring [Medium]Next[LeetCode] 8. String to Integer (atoi)
Last updated