LeetCode】66.Plus One(easy)解题报告

最新推荐文章于 2021-06-29 22:20:44 发布

郝春雨

最新推荐文章于 2021-06-29 22:20:44 发布

阅读量118

点赞数

分类专栏： LeetCode Array 文章标签： leetcode array

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/79450802

版权

LeetCode 同时被 2 个专栏收录

183 篇文章 0 订阅

订阅专栏

Array

65 篇文章 0 订阅

订阅专栏

【LeetCode】66.Plus One(easy)解题报告

题目地址：https://leetcode.com/problems/plus-one/description/
题目描述：

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

You may assume the integer do not contain any leading zero, except the number 0 itself.

The digits are stored such that the most significant digit is at the head of the list.

Solution:

/*
1011  1012
1099  1100
9999  10000
time:O(n)
space : O(n)
*/

class Solution {
    public int[] plusOne(int[] digits) {
        if(digits.length == 0 || digits == null) return 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;
    }
}