LeetCode--No.66--Plus One

原创于 2016-08-14 03:04:05 发布 · 264 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode--Easy 专栏收录该内容

60 篇文章

订阅专栏

本文介绍了一种将非负整数表示为数字数组，并在此基础上加一的算法实现。通过模拟进位操作，该方法从数组的最低位开始逐位进行加一运算，直至最高位。若最高位为9，则继续向前传递进位，必要时扩大数组长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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

Subscribe to see which companies asked this question

思路：模拟进位。从最后一位加加加。

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