LeetCode - 415. Add Strings

最新推荐文章于 2017-06-01 17:27:42 发布

这个好玩吗

最新推荐文章于 2017-06-01 17:27:42 发布

阅读量300

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/flx413/article/details/54588055

版权

LeetCode 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

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.

大整数加法，字符串模拟。

class Solution {
public:
    string addStrings(string num1, string num2) {
        string num = "0123456789";
        int size1 = num1.size();
        int size2 = num2.size();
        
        string ans = "";
        
        if( size1 > size2 ) {
            for( int i = 0; i < size1 - size2; i++ ) {
                num2 = "0" + num2;
            }
        }
        
        if( size2 > size1 ) {
            for( int i = 0; i < size2 - size1; i++ ) {
                num1 = "0" + num1;
            }
        }
        
        int i = size1 > size2 ? size1 - 1 : size2 - 1;
        int r = 0;
        while( i >= 0 ) {
            int add1 = num1[i] - '0';
            int add2 = num2[i] - '0';
            int add = add1 + add2 + r;
            
            if( add > 9 ) r = 1;
            else r = 0;
            
            add = add % 10;
            
            ans = num[add] + ans;
            i--;
        }
        
        if( r == 1 ) {
            ans = "1" + ans;
        }
        
        return ans;
    }
};