문제
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".
제약 조건
0 ≤ numbers.length ≤ 100; each number has 1 to 60 digits
예시
입력:
numbers = ["999", "1"]
예상 출력:
expected = "1000"
입력:
std::vector<std::string> numbers = {"999", "1"};
예상 출력:
std::string expected = "1000";
입력:
string[] numbers = new string[] {"999", "1"};
예상 출력:
string expected = "1000";
설명
Adding 1 to 999 carries through every column: "1000".
입력:
numbers = ["98765432109876543210", "12345678901234567890"]
예상 출력:
expected = "111111111011111111100"
입력:
std::vector<std::string> numbers = {"98765432109876543210", "12345678901234567890"};
예상 출력:
std::string expected = "111111111011111111100";
입력:
string[] numbers = new string[] {"98765432109876543210", "12345678901234567890"};
예상 출력:
string expected = "111111111011111111100";
설명
Column by column the two 20-digit numbers give "111111111011111111100", one digit longer than either.
접근 방법
먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.
힌트 1
Line the numbers up by their last digit.
힌트 2
Add one column at a time, keeping the carry for the next column.
힌트 3
When all columns are done, a leftover carry becomes new leading digits.
예상 복잡도
O(total digits) time, O(max length) extra space
참고 자료
이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.