页面顶部 Top
文件:  root - text - article - 2019 - 12 - reverse-integer.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 478 次阅读, 16060 次搜索 | 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, | 英文 | 主页 | 类别: 计算机科学 | 478 次阅读, 16060 次搜索 | 70 个单词 定阅此目录的博客

猜您喜欢...

  1. Skip the readings, focus on problems. And use all the hints!
  2. Find Pythagorean Triplets
  3. Most Frequent Subtree Sum
  4. Daily Interview Problem: Deepest Node in a Binary Tree
  5. Maximum In A Stack
  6. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  7. Algorithm Interview: Convert Roman Numerals to Decimal
  8. Algorithm Interview: Subarray With Target Sum
  9. Floor and Ceiling of a Binary Search Tree
  10. Print a tree level-by-level, with line-breaks

评论 (0)

    当前页暂时没有评论。


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