Add Strings:字符串相加

Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.

Note:

1. The length of both num1 and num2 is < 5100.
2. Both num1 and num2 contains only digits 0-9.
3. Both num1 and num2 does not contain any leading zero.
4. You must not use any built-in BigInteger library or convert the inputs to integer directly.

思路：和字符串相乘类似，按位运算，注意进位。

class Solution {
    public String addStrings(String num1, String num2) {
        int add = 0;
        int m = num1.length();
        int n = num2.length();
        StringBuilder b = new StringBuilder();
        if(m>n) return addStrings(num2,num1);
        for(int i = m-1,j=n-1;i>=0&&j>=0;i--,j--){
            int sum = add + (num1.charAt(i)-'0') +(num2.charAt(j)-'0');
            b.append(sum%10);
            add = sum/10;
        }
        for(int i = n-m-1;i>=0;i--){
            int sum = add+(num2.charAt(i)-'0');
            b.append(sum%10);
            add = sum/10;
        }
        if(add!=0) b.append(1);
        return b.reverse().toString();
    }
}

当然可以更简洁：

public class Solution {
    public String addStrings(String num1, String num2) {
        StringBuilder sb = new StringBuilder();
        int carry = 0;
        for(int i = num1.length() - 1, j = num2.length() - 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();
    }
}