Plus One

最新推荐文章于 2014-05-20 11:39:58 发布

xinglu31

最新推荐文章于 2014-05-20 11:39:58 发布

阅读量509

点赞数

分类专栏： LeetCode Leetcode记录文章标签： leetcode

本文链接：https://blog.csdn.net/xinglu31/article/details/25827095

版权

Leetcode记录同时被 2 个专栏收录

34 篇文章 0 订阅

订阅专栏

LeetCode

14 篇文章 0 订阅

订阅专栏

public class Solution {
    public int[] plusOne(int[] A) {
        if(A.length >= 1)
		{
			int[] B = new int[A.length + 1];
			int added = 1;
			for(int i = A.length - 1 ; i >= 0 ; i--){
				if(A[i] + added >= 10){
					int tmp = (A[i] + added) %10;
					added = (A[i] + added - tmp) / 10;
					A[i] = tmp;
					B[i + 1] = A[i];
				}else{
					A[i] = A[i] + added;
					added = 0;
				}
			}
			if(added > 0){
				B[0] = added;
				return B;
			}
		}
		return A;
    }
}

Plus One，觉得不能够开辟空间所以卡住了，原来还是可以的