Question:
Given two binany strings a and b. return their sum as a binary string.
給兩個進位字串a跟b 返回他們的合(也是字串)
Example 1:
Input: a = "11", b = "1"
Output: "100"
Example 2:
Input: a = "1010", b = "1011"
Output: "10101"
Constraints:
- 1 <= a.length, b.length <= 104
- a and b consist only of '0' or '1' characters.
- Each string does not contain leading zeros except for the zero itself.
解法 c++
class Solution {
public:
string addBinary(string a, string b){
int n = a.size();
int m = b.size();
int carry = 0;
string result("");
while(n >=0 || m >=0 || carry){
if(n >= 0) carry += a[n