Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 910 with 24 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 910 # by problem number
lcpy gen -s smallest_range_ii # by problem name
nums and an integer k.
For each index i where 0 <= i < nums.length, change nums[i] to be either nums[i] + k or nums[i] - k.
The score of nums is the difference between the maximum and minimum elements in nums.
Return the minimum score of nums after changing the values at each index.
Input: nums = [1], k = 0
Output: 0
Explanation: The score is max(nums) - min(nums) = 1 - 1 = 0.
Input: nums = [0,10], k = 2
Output: 6
Explanation: Change nums to be [2, 8]. The score is max(nums) - min(nums) = 8 - 2 = 6.
Input: nums = [1,3,6], k = 3
Output: 3
Explanation: Change nums to be [4, 6, 3]. The score is max(nums) - min(nums) = 6 - 3 = 3.
class Solution:
# Time: O(n log n) for the sort, then a single linear sweep
# Space: O(1) beyond the sort
def smallest_range_ii(self, nums: list[int], k: int) -> int:
nums = sorted(nums)
result = nums[-1] - nums[0]
low = nums[0] + k
high = nums[-1] - k
for i in range(len(nums) - 1):
big = max(nums[i] + k, high)
small = min(nums[i + 1] - k, low)
result = min(result, big - small)
return result
| Time | Space |
|---|---|
| O(n log n) for the sort, then a single linear sweep | O(1) beyond the sort |