Plus One

Given a non-empty array of digits representing a non-negative integer, increment one to the integer.

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contains a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.

Example 1:

Input: digits = [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.

Example 2:

Input: digits = [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.

Example 3:

Input: digits = [0]
Output: [1]

Constraints:

  • 1 <= digits.length <= 100
  • 0 <= digits[i] <= 9

Hint: Range(n-1, -1, -1) is the syntax in Python to iterate from the end of the list by -1.

Solution:

class Solution:
def plusOne(self, digits) -> List[int]:
'''
:type: digits: List[int]
:rtype: List[int]
'''
n = len(digits)
for i in range(n-1, -1, -1):
if digits[i] < 9:
digits[i] += 1
return digits
else:
digits[i] = 0
return [1] + digits # append an array to the front of the list

Link

Reference

--

--

--

My homepage to record my thought processes for solving SQL and Algorithm questions

Recommended from Medium

Deploying Multiple Organizations in Hyperledger Fabric Version 2.0

A naming convention for UI components

An example of component name with CEV naming convention (Article Card Large, respectively Context, Element and Variant).

Install Hyperledger Fabric in Ubuntu 20.04 LTS

Day 3, def __init__(self) | 100 Days of Code

On the 4thMarch, join us SynAssets on Twitter as we host our first Twitter AMA with @royal_boosters…

C language

How to Convert a Tuple to a String in Python [With Examples]

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Isabelle

Isabelle

In love with telling stories with data

More from Medium

Find if Path Exists in Graph 🚕

Longest Substring Length Without Repeating Character (LeetC

DSA #4 Binary Tree and Binary Search Tree