feat: leetcode 908

Author: deweyou

README.md

@@ -2,7 +2,7 @@
 
 <p align="center">
 <!-- TOPICS COUNT START -->
-<img src="https://img.shields.io/badge/-进度:347-green" alt="进度:347">
+<img src="https://img.shields.io/badge/-进度:348-green" alt="进度:348">
 <!-- TOPICS COUNT END -->
 <a href="./assets/docs/TOPICS.md"><img src="https://img.shields.io/badge/-题库目录-blue" alt="题库目录"></a>
 <a href="./assets/docs/CATEGORIES.md"><img src="https://img.shields.io/badge/-题库分类-red" alt="题库分类"></a>

assets/data/categories.json

@@ -945,6 +945,12 @@
         "path": "./problemset/projection-area-of-3d-shapes/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": "908",
+        "title": "最小差值",
+        "path": "./problemset/smallest-range/README.md",
+        "difficulty": "简单"
+      },
       {
         "id": "1447",
         "title": "最简分数",

assets/data/topics.json

@@ -3099,6 +3099,16 @@
     "url": "https://leetcode-cn.com/problems/sort-array-by-parity/",
     "path": "./problemset/sort-array-by-parity/README.md"
   },
+  {
+    "id": "908",
+    "title": {
+      "cn": "最小差值",
+      "en": "smallest-range"
+    },
+    "difficulty": "简单",
+    "url": "https://leetcode-cn.com/problems/smallest-range-i/",
+    "path": "./problemset/smallest-range/README.md"
+  },
   {
     "id": "917",
     "title": {

assets/docs/CATEGORIES.md

@@ -182,6 +182,7 @@
 | 553. [最优除法](../../problemset/optimal-division/README.md) | 中等 |
 | 762. [二进制表示中质数个计算置位](../../problemset/prime-number-of-set-bits-in-binary-representation/README.md) | 简单 |
 | 883. [三维形体投影面积](../../problemset/projection-area-of-3d-shapes/README.md) | 简单 |
+| 908. [最小差值](../../problemset/smallest-range/README.md) | 简单 |
 | 1447. [最简分数](../../problemset/simplified-fractions/README.md) | 中等 |
 | 1791. [找出星型图的中心节点](../../problemset/find-center-of-star-graph/README.md) | 简单 |
 

assets/docs/TOPICS.md

@@ -620,6 +620,8 @@
 
 [905. 按奇偶排序数组](../../problemset/sort-array-by-parity/README.md)
 
+[908. 最小差值](../../problemset/smallest-range/README.md)
+
 [917. 仅仅反转字母](../../problemset/reverse-only-letters/README.md)
 
 [954. 二倍数对数组](../../problemset/array-of-doubled-pairs/README.md)

problemset/smallest-range/README.md

@@ -0,0 +1,59 @@
+# 最小差值
+
+> 难度：简单
+>
+> https://leetcode-cn.com/problems/smallest-range-i/
+
+## 题目
+
+给你一个整数数组 `nums`，和一个整数 `k` 。
+
+在一个操作中，您可以选择 `0 <= i < nums.length` 的任何索引 `i` 。将 `nums[i]` 改为 `nums[i] + x` ，其中 `x` 是一个范围为 `[-k, k]` 的整数。对于每个索引 `i` ，最多 **只能** 应用 **一次** 此操作。
+
+`nums` 的 **分数** 是 `nums` 中最大和最小元素的差值。 
+
+在对  `nums` 中的每个索引最多应用一次上述操作后，返回 `nums` 的最低 **分数 **。
+
+ 
+### 示例
+
+#### 示例 1：
+
+```
+输入：nums = [1], k = 0
+输出：0
+解释：分数是 max(nums) - min(nums) = 1 - 1 = 0。
+```
+
+#### 示例 2：
+
+```
+输入：nums = [0,10], k = 2
+输出：6
+解释：将 nums 改为 [2,8]。分数是 max(nums) - min(nums) = 8 - 2 = 6。
+```
+
+#### 示例 3：
+
+```
+输入：nums = [1,3,6], k = 3
+输出：0
+解释：将 nums 改为 [4,4,4]。分数是 max(nums) - min(nums) = 4 - 4 = 0。
+```
+
+## 解题
+
+```ts 
+/**
+ * 数学
+ * @desc 时间复杂度 O(N)  空间复杂度 O(1)
+ * @param nums
+ * @param k
+ * @returns
+ */
+export function smallestRangeI(nums: number[], k: number): number {
+  const min = Math.min(...nums)
+  const max = Math.max(...nums)
+  return max - min <= 2 * k ? 0 : max - min - 2 * k
+}
+```

problemset/smallest-range/index.spec.ts

@@ -0,0 +1,15 @@
+import { describe, expect, it } from 'vitest'
+import { smallestRangeI } from '.'
+
+describe('最小差值', () => {
+  testCase(smallestRangeI)
+})
+
+function testCase(fn: (nums: number[], k: number) => number) {
+  it.each([
+    [[1], 0, 0],
+    [[0, 10], 2, 6],
+  ])('示例%#', (nums, k, expected) => {
+    expect(fn(nums, k)).toBe(expected)
+  })
+}

problemset/smallest-range/index.ts

@@ -0,0 +1,12 @@
+/**
+ * 数学
+ * @desc 时间复杂度 O(N)  空间复杂度 O(1)
+ * @param nums
+ * @param k
+ * @returns
+ */
+export function smallestRangeI(nums: number[], k: number): number {
+  const min = Math.min(...nums)
+  const max = Math.max(...nums)
+  return max - min <= 2 * k ? 0 : max - min - 2 * k
+}