/*****************************************************问题描述*************************************************
Given a non-empty array of digits representing a non-negative integer, plus one to the integer.
The digits are stored such that the most significant digit is at the head of the list, and each
element in the array contain a single digit.
You may assume the integer does not contain any leading zero, except the number 0 itself.
Example 1:
Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
Example 2:
Input: [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.
给定一个由非负数字组成的数组,用它代表一个数值,将这个数值加1,返回减1的数值代表的数组
/*****************************************************我的解答*************************************************
/**
* @param {number[]} digits
* @return {number[]}
*/
var plusOne = function(digits)
{
//如果数值不超过js所能表示的最大值,就直接用下面一行代码就可以搞定
//(parseInt(digits.join(''))+1).toString().split('').map(function(item){return parseInt(item)});
//是否进位
var isCarry = true;
for(var index = digits.length - 1; index >= 0; index--)
{
if(isCarry)
{
if(digits[index] + 1 < 10)
{
digits[index] = digits[index] + 1;
isCarry = false;
}
else
{
digits[index] = digits[index] + 1 - 10;
if(index == 0)
{
digits.unshift(1);
}
isCarry = true;
}
}
}
return digits;
};
console.log([6,1,4,5,3,9,0,1,9,5,1,8,6,7,0,5,0,0,0]);
console.log([1,2,3,4,5,6,7,8,9]);
leetCode刷题记录13_66_Plus One
最新推荐文章于 2024-04-25 14:33:33 发布