Plus One — Leetcode July challenge

Given a non-empty array of digits representing a non-negative integer, plus 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 contain a single digit.

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

Example 1:

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

Example 2:

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

Solution:

Just like we add normally, we will start from the endpoint and add one to the last no. in the row. We already know that number is a single digit, which means it cannot exceed 9 and in case of 9 on adding 1 it would be 10, which means we have a carry which will be taken forward. And if carry we will repeat the same steps else we will print out the result

For example in the case of [9, 9, 9], the output would be [1,0,0,0], the carrier has been taken forward and we have got this result

Happy Coding!!!