0
点赞
收藏
分享

微信扫一扫

蓝桥杯_加一_力扣

吴wuwu 2022-03-19 阅读 55

66. 加一

给定一个由 整数 组成的 非空 数组所表示的非负整数,在该数的基础上加一。

最高位数字存放在数组的首位, 数组中每个元素只存储单个数字。

你可以假设除了整数 0 之外,这个整数不会以零开头。

示例 1:

示例 2:

示例 3:

记录题解

import java.math.BigInteger;
import java.util.Arrays;

public class PlusOne{
    public static void main(String[] args) {
        Solution solution = new PlusOne().new Solution();
        int[] digits = new int[]{7,2,8,5,0,9,1,2,9,5,3,6,6,7,3,2,8,4,3,7,9,5,7,7,4,7,4,9,4,7,0,1,1,1,7,4,0,0,6};
        System.out.println(Arrays.toString(solution.plusOne(digits)));
    }

//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int[] plusOne(int[] digits) {
        BigInteger count = new BigInteger("1");
        int length = digits.length;
        BigInteger th = new BigInteger("10");

        for (int i = 0; i < length; i++) {
            BigInteger one = new BigInteger(String.valueOf(digits[i]));
            BigInteger pow = th.pow(length - i - 1);
            BigInteger multiply = one.multiply(pow);
            count = count.add(multiply);
        }

        char[] chars = count.toString().toCharArray();
        int len = chars.length;
        int[] result = new int[len];
        for (int i = 0; i < len; i++) {
            result[i] = chars[i] - 48;
        }

        return result;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}

力扣精选题解

class Solution {
    public int[] plusOne(int[] digits) {
        for (int i = digits.length - 1; i >= 0; i--) {
            digits[i]++;
            digits[i] = digits[i] % 10;
            if (digits[i] != 0) return digits;
        }
        digits = new int[digits.length + 1];
        digits[0] = 1;
        return digits;
    }
}
举报

相关推荐

0 条评论