Notice
Recent Posts
Recent Comments
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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
- 맥북
- 자연어처리
- AI 경진대회
- 프로그래머스 파이썬
- Docker
- Real or Not? NLP with Disaster Tweets
- PYTHON
- 코로나19
- 더현대서울 맛집
- 편스토랑
- 백준
- dacon
- Git
- 편스토랑 우승상품
- 우분투
- github
- hackerrank
- gs25
- 금융문자분석경진대회
- SW Expert Academy
- 캐치카페
- 파이썬
- programmers
- leetcode
- 데이콘
- Baekjoon
- Kaggle
- 프로그래머스
- ubuntu
- ChatGPT
Archives
- Today
- Total
솜씨좋은장씨
[leetCode] 908. Smallest Range I (Python) 본문
728x90
반응형
Given an array A of integers, for each integer A[i] we may choose any x with -K <= x <= K, and add x to A[i].
After this process, we have some array B.
Return the smallest possible difference between the maximum value of B and the minimum value of B.
Example 1:
Input: A = [1], K = 0
Output: 0
Explanation: B = [1]
Example 2:
Input: A = [0,10], K = 2
Output: 6
Explanation: B = [2,8]
Example 3:
Input: A = [1,3,6], K = 3
Output: 0
Explanation: B = [3,3,3] or B = [4,4,4]
Note:
- 1 <= A.length <= 10000
- 0 <= A[i] <= 10000
- 0 <= K <= 10000
Solution
class Solution:
def smallestRangeI(self, A: List[int], K: int) -> int:
return max(max(A) - min(A) - 2 * K, 0)
'Programming > 코딩 1일 1문제' 카테고리의 다른 글
[leetCode] 876. Middle of the Linked List (Python) (0) | 2021.01.18 |
---|---|
[leetCode] 717. 1-bit and 2-bit Characters (Python) (0) | 2021.01.17 |
[leetCode] 520. Detect Capital (Python) (0) | 2021.01.15 |
[leetCode] 237. Delete Node in a Linked List (Python) (0) | 2021.01.14 |
[leetCode] 492. Construct the Rectangle (Python) (0) | 2021.01.13 |
Comments