Skip to content

Latest commit

 

History

History
24 lines (12 loc) · 391 Bytes

File metadata and controls

24 lines (12 loc) · 391 Bytes

Problem 66: Plus One

Difficulty: Easy

Problem

Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.

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

The digits are stored such that the most significant digit is at the head of the list.

Example

[9]

returns ...

[1,0]