To the Top
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 | 539 Views, 17426 Search Bots | 70 Words

Subscribe to Feed Burner | Browse | Archive
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
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 539 Views, 17426 Search Bots | 70 Words Subscribe to Feed Burner

Related Articles

  1. YES!!
  2. Daily Interview Puzzle: Minimum Size Subarray Sum
  3. Daily Interview Problem: Merge List Of Number Into Ranges
  4. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  5. Maximum In A Stack
  6. Algorithm Interview Question: Max and Min with Limited Comparisons
  7. Algorithm Interview: Shifted String
  8. Print a tree level-by-level, with line-breaks
  9. Delphi Dynamic Array
  10. Daily Interview Problem: Min Stack

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />