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

Related Articles

  1. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  2. Daily Interview Problem: Count Number of Unival Subtrees
  3. Making a Height Balanced Binary Search Tree
  4. Algorithm Interview: Shifted String
  5. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  6. Daily Interview Problem: Longest Substring With K Distinct Characters
  7. Top K Frequent words
  8. Daily Interview Problem: Min Range Needed to Sort
  9. Maximum In A Stack
  10. Daily Interview Problem: Group Words that are Anagrams

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="index, follow">