leetcode/en/lc/415/

[giscus[bot]]

leetcode/en/lc/415/

LeetCode solutions in any programming language

https://doocs.github.io/leetcode/en/lc/415/

[rajputanisha]

 Intuition behind the code 

1 -> i will iterate a loop from the end of the string run a loop unitll i>=0
2-> before adding the stirng we simply convert the string into number like this nums[i]-'0;
afetr that i will add the string and also add the carry
If one string is shorter than the other, we assume missing digits as 0
after adding we get carry we directly add it into result;

int addstring(int num1,int num2){
int n = num1.size();
int m = num2.size();
int i = n-1;
int j = m-1;
string result;
int carry = 0;
while (i >= 0 || j >= 0 || carry > 0) {
int digit1 = (i >= 0) ? num1[i] - '0' : 0;
int digit2 = (j >= 0) ? num2[j] - '0' : 0;

        int sum = digit1 + digit2 + carry;
        carry = sum / 10; 
        result += (sum % 10) + '0';  
        i--; 
        j--;
    }
    reverse(result.begin(),result.end());
 return result;

}
}