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 | 1088 Views, 19540 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 | 1088 Views, 19540 Search Bots | 90 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Merge List Of Number Into Ranges
  2. Staying on a Chess Board
  3. Daily Interview Problem: 3 Sum
  4. Daily Interview Problem: Reverse Integer
  5. Floor and Ceiling of a Binary Search Tree
  6. Find Missing Numbers in an Array
  7. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  8. Daily Interview Problem: Circle of Chained Words
  9. Daily Interview Problem: Jump to the End
  10. Algorithm Interview: Determine If Linked List is Palindrome

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