समस्या
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 के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।