| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- Decorator
- 파이썬
- Python
- attribute
- Convert Sorted List to Binary Search Tree
- 컴퓨터의 구조
- Substring with Concatenation of All Words
- Regular Expression
- concurrency
- 밴픽
- DWG
- data science
- Python Code
- Python Implementation
- LeetCode
- 30. Substring with Concatenation of All Words
- 운영체제
- t1
- kaggle
- 시바견
- 715. Range Module
- Protocol
- 43. Multiply Strings
- Generator
- Class
- 프로그래머스
- 315. Count of Smaller Numbers After Self
- shiba
- 109. Convert Sorted List to Binary Search Tree
- iterator
Archives
- Today
- Total
목록3Sum Closest (1)
Scribbling
LeetCode: 16. 3Sum Closest
class Solution: def threeSumClosest(self, nums: List[int], target: int) -> int: ret = int(1e9) nums.sort() for i in range(0, len(nums)-2): l = i + 1 r = len(nums) - 1 while l < r: now_sum = nums[i] + nums[l] + nums[r] if now_sum == target: return target elif now_sum < target: if abs(now_sum - target) < abs(ret - target): ret = now_sum l += 1 else: if abs(now_sum - target) < abs(ret - target): re..
Computer Science/Coding Test
2021. 8. 21. 14:35