일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
Tags
- iterator
- 운영체제
- shiba
- Class
- Python
- 109. Convert Sorted List to Binary Search Tree
- 43. Multiply Strings
- Protocol
- 밴픽
- Substring with Concatenation of All Words
- Python Code
- 프로그래머스
- 315. Count of Smaller Numbers After Self
- Convert Sorted List to Binary Search Tree
- attribute
- DWG
- concurrency
- 파이썬
- LeetCode
- Decorator
- 시바견
- 715. Range Module
- data science
- t1
- kaggle
- Regular Expression
- Generator
- 컴퓨터의 구조
- Python Implementation
- 30. Substring with Concatenation of All Words
Archives
- Today
- Total
Scribbling
LeetCode: 43. Multiply Strings 본문
class Solution:
def multiply(self, num1: str, num2: str) -> str:
if num1 == '0' or num2 == '0':
return '0'
ret = [0] * (len(num1) + len(num2))
for i in range(len(num1)-1, -1, -1):
carry = 0
for j in range(len(num2)-1, -1, -1):
temp = ret[i+j+1] + int(num1[i]) * int(num2[j]) + carry
carry = temp // 10
ret[i+j+1] = temp % 10
ret[i] = carry
ret = ''.join(map(str, ret))
return ret.lstrip('0')
'Computer Science > Coding Test' 카테고리의 다른 글
LeetCode: 43. Multiply Strings (0) | 2021.09.13 |
---|---|
LeetCode: 45. Jump Game II (0) | 2021.09.13 |
LeetCode: 42. Trapping Rain Water (0) | 2021.09.12 |
34. Find First and Last Position of Element in Sorted Array (0) | 2021.09.11 |
33. Search in Rotated Sorted Array (0) | 2021.09.11 |