일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
Tags
- 715. Range Module
- 밴픽
- 시바견
- Protocol
- 30. Substring with Concatenation of All Words
- Convert Sorted List to Binary Search Tree
- DWG
- iterator
- Python
- Python Implementation
- concurrency
- 43. Multiply Strings
- Python Code
- kaggle
- LeetCode
- 컴퓨터의 구조
- Substring with Concatenation of All Words
- shiba
- Decorator
- Generator
- 프로그래머스
- attribute
- Class
- 315. Count of Smaller Numbers After Self
- 운영체제
- t1
- Regular Expression
- 파이썬
- 109. Convert Sorted List to Binary Search Tree
- data science
Archives
- Today
- Total
Scribbling
LeetCode: 67. Add Binary 본문
class Solution:
def addBinary(self, a: str, b: str) -> str:
if len(b) > len(a):
a, b = b, a
b = '0'*(len(a)-len(b)) + b
ret = ''
carry = 0
for i in range(len(a)-1, -1, -1):
temp = int(a[i]) + int(b[i]) + carry
ret += str(temp%2)
carry = temp//2
if carry:
ret += str(1)
return ret[::-1]
'Computer Science > Coding Test' 카테고리의 다른 글
LeetCode: 71. Simplify Path (0) | 2021.09.26 |
---|---|
LeetCode: 69. Sqrt(x) (0) | 2021.09.26 |
LeetCode: 64. Minimum Path Sum (0) | 2021.09.24 |
LeetCode: 63. Unique Paths II (0) | 2021.09.24 |
LeetCode: 62. Unique Paths (0) | 2021.09.24 |