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