首页 > 代码库 > Plus One
Plus One
问题描述
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.
解决方案
public class Solution { public int[] plusOne(int[] digits) { int length = digits.length; boolean addOneDigit = true; for( int digit : digits ) { if( digit != 9 ) { addOneDigit = false; break; } } int[] result = addOneDigit ? new int[length + 1] : new int[length]; if( addOneDigit ) { result[0] = 1; for( int i = 1; i < length; ++i ) { result[i] = 0; } return result; } int add = 1; for( int i = length - 1; i >= 0; --i ) { result[i] = digits[i] + add; if( add == 1 ){ add = 0; } if( result[i] == 10 ) { result[i] = 0; add = 1; } } return result; } }
Plus One
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。