> For the complete documentation index, see [llms.txt](https://anand-aryan.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anand-aryan.gitbook.io/leetcode/66.-plus-one.md).

# 66. Plus One

Plus One

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.

## Solution <a href="#solution" id="solution"></a>

```java
public class Solution {
    public int[] plusOne(int[] digits) {
               int size = digits.length;
        int[] result = new int[size + 1];

        int c = digits[size-1] + 1;
        result[size] = c % 10;
        c = c / 10;

        for (int i = size - 2; i >= 0; i--) {
            int current = c + digits[i];
            result[i+1] = current % 10;
            c = current / 10;
        }

        if (c == 0) {
            int[] finalResult = new int[size];
            for(int i = 0; i < size; i ++) {
                finalResult[i] = result[i + 1];
            }

            return finalResult;
        } else {
            result[0] = c;
            return result;
        } 
    }
}
```