You are given a non-negative integer represented as an integer array, digits, where each element in digits[i] corresponds to a single digit of the integer. The digits are arranged from most significant (left) to least significant (right), and the number has no leading zeros.

Your task is to add one to this integer and return the updated number in the same digit-array format.

Constraints:

• $1 \leq$ digits.length $\leq 100$

• $0 \leq$ digits[i] $\leq 9$

• The digits array does not contain any leading $0$’s.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.