Given two non-negative numbers 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) {
char[] num1s = num1.toCharArray();
char[] num2s = num2.toCharArray();
int flag = 0, temp = 0, len1 = num1s.length - 1, len2 = num2s.

该博客主要介绍了LeetCode中415题的解决方案,题目要求不使用内置库或直接转换输入为整数,而是处理两个表示非负整数的字符串并返回它们的和。字符串长度小于5100,只包含0-9的数字,并且没有前导零。
订阅专栏 解锁全文
390

被折叠的 条评论
为什么被折叠?



