问题描述:
Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.
Note:
- The length of both num1 and num2 is < 5100.
- Both num1 and num2 contains only digits 0-9.
- Both num1 and num2 does not contain any leading zero.
- You must not use any built-in BigInteger library or convert the inputs to integer directly.
注意:
C++ 中int转string,要用to_string(int);
Java中StringBuilder.append(type),type可以是double,float,int,long,Object,String都可以。
C++中字符串取反可以使用string(result.rbegin(), result.rend())
Java中StringBuilder可以直接取反sb.reverse().toString()
C++:
class Solution {
public:
string addStrings(string num1, string num2) {
string result = "";
int len1 = num1.size();
int len2 = num2.size();
int carry = 0;
for (int i = len1 - 1, j = len2 - 1; i >= 0 || j >= 0 || carry == 1; i--, j--) {
int x = i < 0 ? 0 : num1[i] - '0';
int y = j < 0 ? 0 : num2[j] - '0';
cout << x << " " << y << endl;
result.append(to_string((x + y + carry) % 10));
carry = (x + y + carry) / 10;
}
return string(result.rbegin(), result.rend());
}
};
Java:
class Solution {
public String addStrings(String num1, String num2) {
StringBuilder sb = new StringBuilder();
int lena = num1.length();
int lenb = num2.length();
int carry = 0;
for(int i = lena-1,j = lenb-1; i >=0 || j>=0 || carry == 1;i--,j--){
int x = i < 0 ? 0 : num1.charAt(i) - '0';
int y = j < 0 ? 0 : num2.charAt(j) - '0';
sb.append((x + y + carry) % 10);
carry = (x + y + carry) / 10;
}
return sb.reverse().toString();
}
}