File: root - text - article - 2019 - 12 - reverse-integer.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 536 Views, 17293 Search Bots | 70 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 536 Views, 17293 Search Bots | 70 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by LinkedIn:
Write a function that reverses the digits a 32-bit signed integer, x. Assume that the environment can only store integers within the 32-bit signed integer range, [-2^31, 2^31 - 1]. The function returns 0 when the reversed integer overflows.
Example:
Input: 123
Output: 321
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 536 Views, 17293 Search Bots | 70 Words Write a function that reverses the digits a 32-bit signed integer, x. Assume that the environment can only store integers within the 32-bit signed integer range, [-2^31, 2^31 - 1]. The function returns 0 when the reversed integer overflows.
Example:
Input: 123
Output: 321
class Solution:
def reverse(self, x):
# Fill this in.
print(Solution().reverse(123))
# 321
print(Solution().reverse(2**31))
# 0
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Daily Interview Problem: Merge Overlapping Intervals
- How to Play WAV music under DOS?
- Daily Interview Problem: Deepest Node in a Binary Tree
- Daily Interview Problem: Running Median
- Algorithm Interview: Determine If Linked List is Palindrome
- Daily Interview Problem: Jump to the End
- [Daily Problem] Longest Increasing Subsequence
- Daily Interview Problem: 3 Sum
- Detect Linked List Cycle
- Algorithm Interview: Subarray With Target Sum
©2006~2024 SteakOverCooked - 0.01574 Seconds(s) - 1177.731 KB/s - 9 Online
Memory: 494.73 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !