Problème
Each number arrives as a string of decimal digits and can be up to 60 digits long, far past what a 64-bit integer holds. Add them all and return the exact total. This is column addition from school: add digits from the right and carry into the next column.
Implement sum_of_big_numbers(numbers).
Input
numbers: Non-negative integers written as digit strings, without leading zeros (zero itself is "0").
Output
Return the exact sum as a digit string without leading zeros. An empty list sums to "0".
Contraintes
0 ≤ numbers.length ≤ 100; each number has 1 to 60 digits
Exemples
Entrée :
numbers = ["999", "1"]
Sortie attendue :
expected = "1000"
Entrée :
std::vector<std::string> numbers = {"999", "1"};
Sortie attendue :
std::string expected = "1000";
Entrée :
string[] numbers = new string[] {"999", "1"};
Sortie attendue :
string expected = "1000";
Explication
Adding 1 to 999 carries through every column: "1000".
Entrée :
numbers = ["98765432109876543210", "12345678901234567890"]
Sortie attendue :
expected = "111111111011111111100"
Entrée :
std::vector<std::string> numbers = {"98765432109876543210", "12345678901234567890"};
Sortie attendue :
std::string expected = "111111111011111111100";
Entrée :
string[] numbers = new string[] {"98765432109876543210", "12345678901234567890"};
Sortie attendue :
string expected = "111111111011111111100";
Explication
Column by column the two 20-digit numbers give "111111111011111111100", one digit longer than either.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Line the numbers up by their last digit.
Indice 2
Add one column at a time, keeping the carry for the next column.
Indice 3
When all columns are done, a leftover carry becomes new leading digits.
Complexité attendue
O(total digits) time, O(max length) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.