Sponsored
Sponsored
This approach involves reversing both input strings, then iterating through them to sum up each digit, similar to manual addition from the rightmost digit. This technique simplifies handling the carry over during addition.
Time Complexity: O(n), where n is the maximum length of num1 or num2.
Space Complexity: O(n), for the result array.
1#include <stdio.h>
2#include <string.h>
3char* addStrings(char* num1, char* num2) {
4 static char result[10005];
5 memset(result, 0, sizeof(result));
6 int len1 = strlen(num1), len2 = strlen(num2);
7 int carry = 0, i = 0;
8
9 while (len1 > 0 || len2 > 0 || carry) {
10 if (len1 > 0) carry += num1[--len1] - '0';
11 if (len2 > 0) carry += num2[--len2] - '0';
12 result[i++] = (carry % 10) + '0';
13 carry /= 10;
14 }
15
16 result[i] = '\0'; // Null-terminate the string
17
18 for (int j = 0; j < i / 2; j++) { // Reverse result
19 char temp = result[j];
20 result[j] = result[i - j - 1];
21 result[i - j - 1] = temp;
22 }
23 return result;
24}
25
26int main() {
27 char num1[] = "456";
28 char num2[] = "77";
29 printf("%s\n", addStrings(num1, num2));
30 return 0;
31}The function addStrings adds two numbers represented as strings without converting them directly into integers. It accomplishes this by iterating over the digits in reverse, calculating the sum, and storing this in a result string. We keep the process efficient by using a simple loop to handle differing lengths of input strings, adding the carry and reversing the string at the end to present the final sum.
This approach deploys two pointers, initially positioned at the end of each input string. We process each character one by one, moving the pointers from the rightmost end towards the start of each string. This allows us to readily manage the carry as we compute the sum step-by-step.
Time Complexity: O(n), where n is the maximum length of num1 or num2.
Space Complexity: O(n), necessary for the dynamically allocated result string.
1
Using JavaScript, this implementation tackles the character-based addition by calling parseInt for character arithmetic. Positionally reversed allocation into an array simplifies final string formation, addressed with a reverse and join operation at conclusion to provide accurate numerical sums.