415. Add Strings

原题链接：https://leetcode.com/problems/add-strings/

原题：
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.

题意：
给你两个由表示两个非负的数字的字符串，要求你把这两个数字相加后对应的字符串求出来。

思路：
就是先把两个字符串转成对应的数字，用数组来储存各个位上的数字，然后把两个数上同样位数上的数字加起来用一个数组储存，然后再从低位开始进位就好了。
注意点：因为进位应该从低位开始，所以储存结果的数组应该是倒序的。
最后一位不清楚是否有进位，所以要独立讨论。

AC代码：

class Solution {
public:
    string addStrings(string num1, string num2) {

        int differlen=num1.size()-num2.size();
        int maxlen=max(num1.size(),num2.size());
        string differ(abs(differlen),'0');
        differlen<0?num1=differ+num1:num2=differ+num2;
        vector<int> resultnum(maxlen+1,0);
        string result(maxlen,'0');


        for(int i=0;i<maxlen-1;i++){
            resultnum[i]+=(num1[maxlen-1-i]-'0'+num2[maxlen-1-i]-'0');
              if(resultnum[i]>=10){
                resultnum[i+1]+=resultnum[i]/10;
                resultnum[i]=resultnum[i]%10;
                result[maxlen-1-i]=resultnum[i]+'0';
            }
            else{
                result[maxlen - 1 - i] = resultnum[i] + '0';
        }
        }

        resultnum[maxlen-1]+=(num1[0]-'0'+num2[0]-'0');

        if(resultnum[maxlen-1]>=10){
            result[0]=resultnum[maxlen-1]%10+'0';
            result = '1' + result;
        }
        else result[0]=resultnum[maxlen-1]+'0';
        return result;

    }
};