415. Add Strings

原题链接

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.

思路:和二进制加法几乎一样。

AC代码:

class Solution {
public:
    string addStrings(string a, string b)
    {
        reverse(a.begin(), a.end());
        reverse(b.begin(), b.end());
        int f = 0;
        if(a.length()>b.length()) swap(a,b);
        string res(b);
        for(int i=0;i<a.length();i++)
        {
            res[i] += ((a[i]-'0') + f);
            if(res[i]>'9')
            {
                res[i] -= 10;
                f = 1;
            }
            else f = 0;
        }

        for(int i=a.length();i<b.length();i++)
        {
            res[i] += f;
            if(res[i]>'9')
            {
                res[i] -= 10;
                f = 1;
            }
            else f = 0;
        }
        if(f==1)
            res+="1";

        reverse(res.begin(), res.end());

        return res;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值