Plus One
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. FAILED APPROACH: class Solution { public int[] plusOne(int[] digits) { digits[digits.length-1]+=1; return digits; } } Try it on Leetcode Above code seems to be correct, the mistake occurs when at end contains 9 Input Output Output according to our code i.e., [9] - [1, 0] - [10] [9, 9] - [1, 0, 0] - [9, 10] Thus above code is not a solution for this problem. SUCCESSFULL APPR