zoukankan      html  css  js  c++  java
  • Plus One

    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.

    public int[] plusOne(int[] digits) {
            int length = digits.length;
            digits[length-1]+=1;
            int i = length-1;
            //做下标为1-n的位置
            while (i>0){
                if (digits[i]<10){
                    return digits;
                }
                else {
                    int j = digits[i]%10;
                    digits[i] = j;
                    digits[i-1]+=1;
                }
                i--;
            }
            //做下标为0的位置
            if (digits[0]<10){
                return digits;
            }
            else {
                digits[0]%=10;
                int[] plusone = new int[length+1];
                plusone[0]=1;
                for (int m=0;m<length;m++){
                    plusone[m+1]=digits[m];
                }
                return plusone;
            }
        }
    
  • 相关阅读:
    第一篇博客
    margin 与 padding
    CSS伪类
    CSS定位
    利用css布局在图片插入文字
    CSS选择符
    CSS伪类
    CSS语法顺序
    CSS样式特点及优先级
    frame-框架
  • 原文地址:https://www.cnblogs.com/bingo2-here/p/8502695.html
Copyright © 2011-2022 走看看