908. Smallest Range I

Easy

589

1.9K

You are given an integer array `nums`

and an integer `k`

.

In one operation, you can choose any index `i`

where `0 <= i < nums.length`

and change `nums[i]`

to `nums[i] + x`

where `x`

is an integer from the range `[-k, k]`

. You can apply this operation **at most once** for each index `i`

.

The **score** of `nums`

is the difference between the maximum and minimum elements in `nums`

.

Return *the minimum score of *

`nums`

**Example 1:**

Input:nums = [1], k = 0Output:0Explanation:The score is max(nums) - min(nums) = 1 - 1 = 0.

**Example 2:**

Input:nums = [0,10], k = 2Output:6Explanation:Change nums to be [2, 8]. The score is max(nums) - min(nums) = 8 - 2 = 6.

**Example 3:**

Input:nums = [1,3,6], k = 3Output:0Explanation:Change nums to be [4, 4, 4]. The score is max(nums) - min(nums) = 4 - 4 = 0.

**Constraints:**

`1 <= nums.length <= 10`

^{4}`0 <= nums[i] <= 10`

^{4}`0 <= k <= 10`

^{4}

Accepted

73.4K

Submissions

107.3K

Acceptance Rate

68.4%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved