Count Commas in Range
2026. 3. 15. 13:29ㆍAlgorithm/Leetcode, Lintcode, HackerRank, etc.
- 목차
반응형
class Solution:
def countCommas(self, n: int) -> int:
if n < 1000:
return 0
return n - 1000 + 1반응형
'Algorithm > Leetcode, Lintcode, HackerRank, etc.' 카테고리의 다른 글
| First Unique Even Element (0) | 2026.03.15 |
|---|---|
| Count commas in range II (0) | 2026.03.15 |
| Longest Univalve path (0) | 2026.03.15 |
| Implement Trie (0) | 2026.03.15 |
| Binary Tree Level Order Traverse (0) | 2026.03.15 |
