Plus One (E)
題目
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后的整數(依然用陣串列示)，
思路
注意進位即可，
代碼實作
Java
class Solution {
public int[] plusOne(int[] digits) {
int i = digits.length - 1;
digits[i]++;
int carry = digits[i] / 10;
digits[i] = digits[i] % 10;
// 需要進位則一直向前
while (carry != 0 && i >= 1) {
i--;
digits[i] = digits[i] + carry;
carry = digits[i] / 10;
digits[i] = digits[i] % 10;
}
// 仍需要進位，說明需要新增一位數
if (carry != 0) {
int[] temp = new int[digits.length + 1];
for (int j = 1; j < temp.length; j++) {
temp[j] = digits[j - 1];
}
temp[0] = carry;
digits = temp;
}
return digits;
}
}
JavaScript
/**
* @param {number[]} digits
* @return {number[]}
*/
var plusOne = function (digits) {
let i = digits.length - 1
let carry = 1
while (i >= 0 && carry > 0) {
digits[i] += carry
carry = Math.trunc(digits[i] / 10)
digits[i] %= 10
i--
}
if (carry > 0) {
digits.splice(0, 0, carry)
}
return digits
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/27719.html
標籤：其他