Simple solution | faster than 98.82%
\n    public class Solution\n    {\n        public int[] PlusOne(int[] digits)\n        {\n            for (int i = digits.Length - 1; i >= 0; i--)\n           
```\n    public class Solution\n    {\n        public int[] PlusOne(int[] digits)\n        {\n            for (int i = digits.Length - 1; i >= 0; i--)\n            {\n                if (digits[i] == 9)\n                {\n                    digits[i] = 0;\n                }\n                else\n                {\n                    digits[i]++;\n                    return digits;\n                }\n            }\n            int[] newBigOne = new int[digits.Length + 1];\n            newBigOne[0] = 1;\n            return newBigOne;\n        }\n    }\n```
[]