Plus One LeetCode Java

// https://leetcode.com/problems/plus-one/

class Solution {
    public int[] plusOne(int[] digits) {
        for (int i = digits.length -1 ; i >= 0; i-- ){
            if (digits[i] < 9){
                digits[i]++;
                return digits;
            }
            digits[i] = 0;
        }
        
        int[] result = new int[digits.length + 1];
        result[0] = 1;
        return result;
    }
}

Similar codes

0 vote125 views1 answer
Swagger apiimplicitparam all endpoints
Java
11 votes113 views2 answers
Java list to set
Java
1 vote109 views1 answer
Circular list java
Java
0 vote141 views2 answers
Cors spring method or class
Java Spring
0 vote104 views1 answer
Unable to access jarfile
Java
1 vote123 views1 answer
Package within another java
Java
1 vote120 views2 answers
Stringbuilder with delimiter java
Java
0 vote125 views1 answer
Peak index in a mountain array
Java
0 vote136 views1 answer
Search in rotated sorted array leetcode
Java
0 vote119 views1 answer
Add element in the last in double linked list in java
Java