mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
35 lines
1.2 KiB
HTML
35 lines
1.2 KiB
HTML
<p>Given two non-negative integers, <code>num1</code> and <code>num2</code> represented as string, return <em>the sum of</em> <code>num1</code> <em>and</em> <code>num2</code> <em>as a string</em>.</p>
|
|
|
|
<p>You must solve the problem without using any built-in library for handling large integers (such as <code>BigInteger</code>). You must also not convert the inputs to integers directly.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> num1 = "11", num2 = "123"
|
|
<strong>Output:</strong> "134"
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> num1 = "456", num2 = "77"
|
|
<strong>Output:</strong> "533"
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> num1 = "0", num2 = "0"
|
|
<strong>Output:</strong> "0"
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= num1.length, num2.length <= 10<sup>4</sup></code></li>
|
|
<li><code>num1</code> and <code>num2</code> consist of only digits.</li>
|
|
<li><code>num1</code> and <code>num2</code> don't have any leading zeros except for the zero itself.</li>
|
|
</ul>
|