66. Plus One

作者: 夜皇雪 | 来源:发表于2016-12-14 03:47 被阅读0次

LeetCode 66-70
66. Plus One
Google面经（持续更新）
leetcode:66. Plus One
LeetCode：66. 加一
[Math/Array]66. Plus One
Leetcode-66 加一
66. 加一
66. Plus One
66. Plus One

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

LeetCode 66-70
66. Plus One[https://leetcode-cn.com/problems/plus-one/] ...
66. Plus One
66. Plus One 题目：https://leetcode.com/problems/plus-one/ 难...
Google面经（持续更新）
66. Plus One Given a non-negative integer represented as ...
leetcode:66. Plus One
66. Plus One Description Given a non-empty array of digit...
LeetCode：66. 加一
问题链接 66. 加一[https://leetcode-cn.com/problems/plus-one] 问题...
[Math/Array]66. Plus One
分类：Math/Array 时间复杂度: O(n) 66. Plus One Given a non-empty ...
Leetcode-66 加一
66. 加一[https://leetcode-cn.com/problems/plus-one/] 解题思路 1...
66. 加一
题目地址(66. 加一) https://leetcode.cn/problems/plus-one/[https...
66. Plus One
Problem Given a non-empty array of digits representing a ...
66. Plus One
https://leetcode.com/problems/plus-one/description/解题思路：本...