首页 > 其他 > 详细

LeetCode - Plus One

时间:2015-12-30 07:00:00      阅读:174      评论:0      收藏:0      [点我收藏+]

题目:

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.

思路:

进位

package manipulation;

public class PlusOne {

    public int[] plusOne(int[] digits) {
        int n = digits.length;
        int i = n - 1;
        for (; i >= 0; --i) {
            if (digits[i] != 9) {
                ++digits[i];
                return digits;
            } else {
                digits[i] = 0;
            }
        }
        
        digits = new int[n + 1];
        digits[0] = 1;
        return digits;
    }
    
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] digits = { 8,9,9 };
        PlusOne p = new PlusOne();
        for (int i : p.plusOne(digits))
            System.out.println(i);
    }

}

 

LeetCode - Plus One

原文:http://www.cnblogs.com/shuaiwhu/p/5087618.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!