Leetcode---Plus one carry array

Given a non-negative number represented as an array of digits, plus one to the number.

The digits is stored such, the most significant digit was at the head of the list.

Problem-solving ideas: integers plus 1, you need to consider whether the carry and the final result will be more than one, such as 99,999 such a situation.

Package Leedcode;

public class PlusOne {

    private static int[] plus (int[] digits) {
        if (digits.length==0| | Digits==null) return digits;
        for (int i = digits.length-1; I >= 0; i--) {//loop essentially replaces carry
            digits[i] = digits[i] + 1;
            if (digits[i] = = ten)
                digits[i] = 0;
            else
                return digits;
        }
        Int[] res= new Int[digits.length + 1];
        Res[0] = 1;
        return res;
    }

    public static void Main (string[] args) {
        int[] tes = {9, 9};
        int[] res = plus (tes);
        for (int i = 0; i < res.length; i++) {
            System.out.print (Res[i] + "");}}}