Sum—LeetCode-415 Add Strings
题目描述:Given two non-negative integers num1 andnum2 represented as string, return the sum ofnum1 and num2.Note:The length of both num1 andnum2 is Both num1 andnum2 contains only digits
·
题目描述:
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.
public String addStrings(String num1, String num2) {
int len = Math.max(num1.length(), num2.length());
char ch[] = new char[len + 1];
int i = num1.length() - 1, j = num2.length() - 1;
int c = 0, k = len;
while(i >= 0 && j >= 0){
int tempI = num1.charAt(i) - '0';
int tempJ = num2.charAt(j) - '0';
int tempSum = tempI + tempJ + c;
ch[k] = String.valueOf(tempSum % 10).charAt(0);
c = tempSum / 10;
--k;
--i;
--j;
}
while(i >= 0) {
int tempI = num1.charAt(i) - '0';
int tempSum = tempI + c;
ch[k] = String.valueOf(tempSum % 10).charAt(0);
c = tempSum / 10;
--k;
--i;
}
while(j >= 0) {
int tempJ = num2.charAt(j) - '0';
int tempSum = tempJ + c;
ch[k] = String.valueOf(tempSum % 10).charAt(0);
c = tempSum / 10;
--k;
--j;
}
int flag = 0;
if(c != 0) {
flag = 1;
ch[0] = String.valueOf(c).charAt(0);
}
String tempStr = String.valueOf(ch);
if(flag == 0)
return tempStr.substring(1);
else
return tempStr;
}
开放原子开发者工作坊旨在鼓励更多人参与开源活动,与志同道合的开发者们相互交流开发经验、分享开发心得、获取前沿技术趋势。工作坊有多种形式的开发者活动,如meetup、训练营等,主打技术交流,干货满满,真诚地邀请各位开发者共同参与!
更多推荐
已为社区贡献3条内容
所有评论(0)