页面顶部 Top
文件:  root - text - article - 2019 - 12 - reverse-integer.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 490 次阅读, 16302 次搜索 | 70 个单词

定阅此目录的博客 | 浏览 | 博客存档
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


class Solution:
def reverse(self, x):
# Fill this in.

print(Solution().reverse(123))
# 321
print(Solution().reverse(2**31))
# 0
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 490 次阅读, 16302 次搜索 | 70 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Arithmetic Binary Tree
  2. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  3. Daily Interview Problem: Merge K Sorted Linked Lists
  4. Non-decreasing Array with Single Modification
  5. Algorithm Interview: Subarray With Target Sum
  6. Maximum In A Stack
  7. Compare Version Numbers
  8. Algorithm Interview: Maximum Path Sum in Binary Tree
  9. Generate All IP Addresses
  10. Daily Interview Problem: Min Stack

评论 (0)

您的邮件 (不公开域名部分):

您的评论:

悄悄话(发邮件) 颜色 更多笑脸 S x y @

验证码 (点击图片更新):

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />