标签:989 LC Form int ret sj vector Output array
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]
.
Given the array-form A
of a non-negative integer X
, return the array-form of the integer X+K
.
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:
1 <= A.length <= 10000
0 <= A[i] <= 9
0 <= K <= 10000
- If
A.length > 1
, thenA[0] != 0
class Solution { public: vector<int> addToArrayForm(vector<int>& A, int K) { vector<int> ka = itoarray(K); for(int a : ka) cout << a << endl; reverse(A.begin(), A.end()); vector<int> ret; int endi = max(A.size(), ka.size()); int add1, add2, sleft, sj; sj = 0; for(int i=0; i<endi; i++) { add1 = add2 = sleft = 0; if(i < A.size()) add1 = A[i]; if(i < ka.size()) add2 = ka[i]; sleft = sj + add1 + add2; if(sleft >= 10) {sj = 1; sleft %= 10;} else sj = 0; ret.push_back(sleft); } if(sj == 1) ret.push_back(1); reverse(ret.begin(), ret.end()); return ret; } vector<int> itoarray(int K) { vector<int> a; while(K != 0) { a.push_back(K % 10); K /= 10; } return a; } };
标签:989,LC,Form,int,ret,sj,vector,Output,array 来源: https://www.cnblogs.com/ethanhong/p/10359872.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。