题目来源于 LeetCode 上第 989号(Add to Array-Form of Integer)问题,题目难度为 Easy,AC率44.6%git
题目地址:https://leetcode.com/problems/add-to-array-form-of-integer/面试
For a non-negative integer X, the array-form of X is an array of its digits in left to right order. For example, if X = 1231, then the array form is [1,2,3,1].算法
对于非负整数 X 而言,X 的数组形式是每位数字按从左到右的顺序造成的数组。例如,若是 X = 1231,那么其数组形式为 [1,2,3,1]数组
Given the array-form A of a non-negative integer X, return the array-form of the integer X+K.bash
给定非负整数 X 的数组形式 A,返回整数 X+K 的数组形式post
Example 1:
Input: A = [1,2,0,0], K = 34
Output: [1,2,3,4]
Explanation: 1200 + 34 = 1234
Example 2:
Input: A = [2,7,4], K = 181
Output: [4,5,5]
Explanation: 274 + 181 = 455
Example 3:
Input: A = [2,1,5], K = 806
Output: [1,0,2,1]
Explanation: 215 + 806 = 1021
Example 4:
Input: A = [9,9,9,9,9,9,9,9,9,9], K = 1
Output: [1,0,0,0,0,0,0,0,0,0,0]
Explanation: 9999999999 + 1 = 10000000000
复制代码
Note:ui
数组从右往左,依次取值相同位数和 K 相加,例如: A = [2,1,5], K = 806spa
Note: 最后咱们须要考虑执行效率,如何正确选择集合3d
算法效率以下: code
class Solution {
public List<Integer> addToArrayForm(int[] A, int K) {
List<Integer> result = new LinkedList<Integer>();
for (int i = A.length - 1; i >= 0; i--) {
K = K + A[i];
if (K >= 0) result.add(0, K % 10);
K = K / 10;
}
while (K > 0) {
result.add(0, K % 10);
K = K / 10;
}
return result;
}
}
复制代码