Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b
= "1"
Return "100".
很简单的题，代码写麻烦了。注意string加的顺序。
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80 |
class
Solution {public: string addBinary(string a, string b) { int
la = a.length()-1; int
lb = b.length()-1; string re; int
flag = 0; while(la >= 0 && lb >= 0) { if(a[la] == ‘1‘
&& b[lb] == ‘1‘) { if(flag == 1) re = "1"
+ re; else re = "0"
+ re; flag = 1; la--; lb--; continue; } if(a[la] == ‘1‘
|| b[lb] == ‘1‘) { if(flag == 1) { re = "0"
+ re; flag = 1; } else { re = "1"
+ re; flag = 0; } la--; lb--; continue; } if(a[la] == ‘0‘
|| b[lb] == ‘0‘) { if(flag==0) re = "0"+re; else
re = "1" +re; flag=0; la--; lb--; continue; } } while(la >=0) { if(a[la] == ‘1‘
&& flag == 1) { re = "0"
+re; } else
if(a[la] == ‘0‘
&& flag == 0) { re = "0"
+re; flag = 0; } else
{re ="1" +re;flag = 0;} la--; } while(lb >=0) { if(b[lb] == ‘1‘
&& flag == 1) { re = "0"
+re; } else
if(b[lb] == ‘0‘
&& flag == 0) { re = "0"
+re; flag = 0; } else
{re ="1" +re;flag = 0;} lb--; } if(flag == 1) re = "1"+re; return
re; }}; |
原文：http://www.cnblogs.com/pengyu2003/p/3575051.html