Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
64 lines (50 loc) · 1.35 KB

File metadata and controls

64 lines (50 loc) · 1.35 KB
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#!/usr/bin/env python
'''
Leetcode: Add binary
Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b = "1"
Return "100".
'''
from __future__ import division
import random
def valid_binary_str(s):
for bit in list(s):
if bit != '0' and bit != '1': return False
return True
# Special cases: negative numbers? not a valid binary string?
def add_binary(a, b):
if (not valid_binary_str(a)) or (not valid_binary_str(b)): return None
print a,'+',b,'=',
# make a and b of equal lengths
l = max(len(a), len(b))
while len(a) < l: a = '0'+a
while len(b) < l: b = '0'+b
i = l-1
results = ""
prev_carry = 0
while i >= 0:
x, y = int(a[i]), int(b[i])
# add current bits
z = x ^ y
cur_carry = x & y
# add previous carry
if prev_carry == 1:
if z == 1: z = 0; cur_carry = 1
else: z = 1
cur_carry = (z & prev_carry) | cur_carry
z = z ^ prev_carry
results = str(z) + results
prev_carry = cur_carry
i -= 1
# last carry
if prev_carry: results = '1'+results
print results
return results
if __name__ == '__main__':
add_binary('11','1')
add_binary('101011','1111')
add_binary('101','1111')
add_binary('0','0')
add_binary('11','1222')
Morty Proxy This is a proxified and sanitized view of the page, visit original site.