[0ms][1LINER][100%][Fastest Solution Explained] O(n)time complexity O(n)space complexity
\n(Note: This is part of a series of Leetcode solution explanations. If you like this solution or find it useful, please upvote this post.)\nTake care brother, 
\n(Note: This is part of a series of Leetcode solution explanations. If you like this solution or find it useful, ***please upvote*** this post.)\n***Take care brother, peace, love!***\n\n```\n```\n\nThe best result for the code below is ***0ms / 3.27MB*** (beats 99.04% / 90.42%).\n\n```\n\nclass Solution {\n    public int[] plusOne(int[] digits) {\n        \n    int n = digits.length;\n    for(int i=n-1; i>=0; i--) {\n        if(digits[i] < 9) {\n            digits[i]++;\n            return digits;\n        }\n        \n        digits[i] = 0;\n    }\n    \n    int[] newNumber = new int [n+1];\n    newNumber[0] = 1;\n    \n    return newNumber;\n}\n}\n\n```\n\n```\n```\n\n```\n```\n\n***"Open your eyes. Expect us." - \uD835\uDCD0\uD835\uDCF7\uD835\uDCF8\uD835\uDCF7\uD835\uDD02\uD835\uDCF6\uD835\uDCF8\uD835\uDCFE\uD835\uDCFC***\n\n\n
['Swift', 'C', 'PHP', 'Python', 'C++', 'Java', 'Python3', 'Kotlin']