908. Smallest Range I
range Smallest
2023-09-11 14:22:44 时间
Given an array
A
of integers, for each integerA[i]
we may choose anyx
with-K <= x <= K
, and addx
toA[i]
.After this process, we have some array
B
.Return the smallest possible difference between the maximum value of
B
and the minimum value ofB
.
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
Approach #1: Math. [Java]
class Solution { public int smallestRangeI(int[] A, int K) { int min = Integer.MAX_VALUE; int max = Integer.MIN_VALUE; for (int i = 0; i < A.length; ++i) { if (min > A[i]) min = A[i]; if (max < A[i]) max = A[i]; } if (max - min < 2 * K) return 0; return max - min - 2 * K; } }
Analysis:
If you can find that the result only relate with (max - min) and 2 * K, it will become easy to solve.
相关文章
- python中的range与xrange
- [Kotlin] Loop range
- 分区表-RANGE
- golang管道channel的遍历和关闭:应该使用for...range来遍历
- 已解决UnicodeEncodeError: ‘ascii‘ codec can‘t encode characters in position 0-1: ordinal not in range(1
- Python标准库:内置函数range(stop) range(start, stop[, step])
- leetcode 598. Range Addition II
- c++stl之lower_bound,upper_bound和equal_range函数的详细介绍!!!