Plus One

来源:互联网 发布:linux swap分区大小 编辑:程序博客网 时间:2024/05/01 09:28
    public int[] plusOne(int[] digits) {        // Start typing your Java solution below        // DO NOT write main() function        if(digits.length == 0) return digits;        int size = digits.length - 1;        int carry = 0;        int tmp = 0;        digits[size] += 1;        for(int i = size; i >= 0; i--) {            tmp = (digits[i] + carry) % 10;            carry = (digits[i] + carry) / 10;            digits[i] = tmp;        }        if(carry == 0) return digits;        else {            int[] result = new int[size + 2];            result[0] = carry;            return result;        }    }

原创粉丝点击