LeetCode --- 989. Add to Array-Form of Integer 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 989. Add to Array-Form of Integer 解题报告相关的知识,希望对你有一定的参考价值。
The array-form of an integer num
is an array representing its digits in left to right order.
- For example, for
num = 1321
, the array form is[1,3,2,1]
.
Given num
, the array-form of an integer, and an integer k
, return the array-form of the integer num + k
.
Example 1:
Input: num = [1,2,0,0], k = 34 Output: [1,2,3,4] Explanation: 1200 + 34 = 1234
Example 2:
Input: num = [2,7,4], k = 181 Output: [4,5,5] Explanation: 274 + 181 = 455
Example 3:
Input: num = [2,1,5], k = 806 Output: [1,0,2,1] Explanation: 215 +
以上是关于LeetCode --- 989. Add to Array-Form of Integer 解题报告的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode --- 989. Add to Array-Form of Integer 解题报告
LeetCode --- 989. Add to Array-Form of Integer 解题报告