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

Related Articles

  1. Floor and Ceiling of a Binary Search Tree
  2. Daily Interview Problem: Reverse Words in a String
  3. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  4. [Daily Problem] Course Prerequisites
  5. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  6. Algorithm Interview Question: H-Index
  7. Algorithm Interview: Determine If Linked List is Palindrome
  8. Making a Height Balanced Binary Search Tree
  9. Algorithm Interview: Maximum Path Sum in Binary Tree
  10. Daily Interview Problem: Room scheduling

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