To the Top
File:  root - text - article - 2020 - 02 - plus-one.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 1132 Views, 20308 Search Bots | 90 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by LinkedIn:

Given a non-empty array where each element represents a digit of a non-negative integer, add one to the integer. The most significant digit is at the front of the array and each element in the array contains only one digit. Furthermore, the integer does not have leading zeros, except in the case of the number '0'.

Example:
Input: [2,3,4]
Output: [2,3,5]

class Solution():
def plusOne(self, digits):
# Fill this in.

num = [2, 9, 9]
print(Solution().plusOne(num))
# [3, 0, 0]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 1132 Views, 20308 Search Bots | 90 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview: Longest Consecutive Sequence
  2. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  3. Daily Interview Problem: Largest Product of 3 Elements I
  4. Daily Interview Puzzle: Minimum Size Subarray Sum
  5. Daily Interview Problem: Room scheduling
  6. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  7. Batch Programming in XP
  8. Daily Interview Problem: Merge List Of Number Into Ranges
  9. A trick for getting good at coding interviews FASTER
  10. Design Tic-Tac-Toe

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" />