mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
26 lines
854 B
HTML
26 lines
854 B
HTML
|
<p>给你两个二进制字符串,返回它们的和(用二进制表示)。</p>
|
||
|
|
||
|
<p>输入为 <strong>非空 </strong>字符串且只包含数字 <code>1</code> 和 <code>0</code>。</p>
|
||
|
|
||
|
<p> </p>
|
||
|
|
||
|
<p><strong>示例 1:</strong></p>
|
||
|
|
||
|
<pre><strong>输入:</strong> a = "11", b = "1"
|
||
|
<strong>输出:</strong> "100"</pre>
|
||
|
|
||
|
<p><strong>示例 2:</strong></p>
|
||
|
|
||
|
<pre><strong>输入:</strong> a = "1010", b = "1011"
|
||
|
<strong>输出:</strong> "10101"</pre>
|
||
|
|
||
|
<p> </p>
|
||
|
|
||
|
<p><strong>提示:</strong></p>
|
||
|
|
||
|
<ul>
|
||
|
<li>每个字符串仅由字符 <code>'0'</code> 或 <code>'1'</code> 组成。</li>
|
||
|
<li><code>1 <= a.length, b.length <= 10^4</code></li>
|
||
|
<li>字符串如果不是 <code>"0"</code> ,就都不含前导零。</li>
|
||
|
</ul>
|