| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- 30. Substring with Concatenation of All Words
- DWG
- 컴퓨터의 구조
- 715. Range Module
- t1
- 프로그래머스
- iterator
- Convert Sorted List to Binary Search Tree
- concurrency
- Regular Expression
- 109. Convert Sorted List to Binary Search Tree
- 43. Multiply Strings
- Decorator
- 운영체제
- 밴픽
- shiba
- data science
- Class
- Substring with Concatenation of All Words
- Python Code
- kaggle
- Protocol
- Python Implementation
- Generator
- 파이썬
- 시바견
- 315. Count of Smaller Numbers After Self
- LeetCode
- Python
- attribute
Archives
- Today
- Total
목록Maximum Product Subarray (1)
Scribbling
LeetCode: 152. Maximum Product Subarray
class Solution: def maxProduct(self, nums: List[int]) -> int: ret = -int(1e9) prod = 1 for num in nums: prod *= num ret = max(ret, prod) if num == 0: prod = 1 prod = 1 for i in range(len(nums)-1, -1, -1): prod *= nums[i] ret = max(ret, prod) if nums[i] == 0: prod = 1 return ret
Computer Science/Coding Test
2021. 11. 29. 16:42