🗓️ Daily LeetCoding Challenge May, Day 1
class Solution:
def average(self, salary: List[int]) -> float:
return (sum(salary) - min(salary) - max(salary)) / (len(salary) - 2)'CS > 알고리즘' 카테고리의 다른 글
| [Leetcode] 82. Remove Duplicates from Sorted List II (0) | 2023.05.04 |
|---|---|
| [Leetcode] 2215. Find the Difference of Two Arrays (0) | 2023.05.03 |
| [Leetcode] 1822. Sign of the Product of an Array (0) | 2023.05.02 |
| [Leetcode] 121. Best Time to Buy and Sell Stock (0) | 2023.05.02 |
| [Leetcode 334] 334. Increasing Triplet Subsequence (0) | 2023.05.02 |