FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/add-binary.py at master · Addoile/LeetCode-Solutions · GitHub
Addoile
LeetCode-Solutions
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
Python
/
add-binary.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
44 lines (37 loc) · 1.04 KB
Breadcrumbs
LeetCode-Solutions
/
Python
/
add-binary.py
Copy path
File metadata and controls
44 lines (37 loc) · 1.04 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
# Time: O(n)
# Space: O(1)
class
Solution
(
object
):
# @param a, a string
# @param b, a string
# @return a string
def
addBinary
(
self
,
a
,
b
):
result
,
carry
,
val
=
""
,
0
,
0
for
i
in
xrange
(
max
(
len
(
a
),
len
(
b
))):
val
=
carry
if
i
<
len
(
a
):
val
+=
int
(
a
[
-
(
i
+
1
)])
if
i
<
len
(
b
):
val
+=
int
(
b
[
-
(
i
+
1
)])
carry
,
val
=
divmod
(
val
,
2
)
result
+=
str
(
val
)
if
carry
:
result
+=
str
(
carry
)
return
result
[::
-
1
]
# Time: O(n)
# Space: O(1)
from
itertools
import
izip_longest
class
Solution2
(
object
):
def
addBinary
(
self
,
a
,
b
):
"""
:type a: str
:type b: str
:rtype: str
"""
result
=
""
carry
=
0
for
x
,
y
in
izip_longest
(
reversed
(
a
),
reversed
(
b
),
fillvalue
=
"0"
):
carry
,
remainder
=
divmod
(
int
(
x
)
+
int
(
y
)
+
carry
,
2
)
result
+=
str
(
remainder
)
if
carry
:
result
+=
str
(
carry
)
return
result
[::
-
1
]
Back
|
FazBrowse Home
|
New Git URL