feat: leetcode 1775

Author: ouduidui

Diff for: README.md

@@ -2,7 +2,7 @@
 
 <p align="center">
 <!-- TOPICS COUNT START -->
-<img src="https://img.shields.io/badge/-进度:563-green" alt="进度:563">
+<img src="https://img.shields.io/badge/-进度:565-green" alt="进度:565">
 <!-- 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>

Diff for: assets/data/categories.json

@@ -362,6 +362,12 @@
         "path": "./problemset/maximum-number-of-balls-in-a-box/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": "1775",
+        "title": "通过最少操作次数使数组的和相等",
+        "path": "./problemset/equal-sum-arrays-with-minimum-number-of-operations/README.md",
+        "difficulty": "中等"
+      },
       {
         "id": "1832",
         "title": "判断句子是否为全字母句",
@@ -4108,6 +4114,12 @@
         "path": "./problemset/maximum-units-on-a-truck/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": "1775",
+        "title": "通过最少操作次数使数组的和相等",
+        "path": "./problemset/equal-sum-arrays-with-minimum-number-of-operations/README.md",
+        "difficulty": "中等"
+      },
       {
         "id": "2038",
         "title": "如果相邻两个颜色均相同则删除当前颜色",

Diff for: assets/data/topics.json

@@ -5219,6 +5219,16 @@
     "url": "https://leetcode.cn/problems/closest-dessert-cost/",
     "path": "./problemset/closest-dessert-cost/README.md"
   },
+  {
+    "id": "1775",
+    "title": {
+      "cn": "通过最少操作次数使数组的和相等",
+      "en": "equal-sum-arrays-with-minimum-number-of-operations"
+    },
+    "difficulty": "中等",
+    "url": "https://leetcode.cn/problems/equal-sum-arrays-with-minimum-number-of-operations/",
+    "path": "./problemset/equal-sum-arrays-with-minimum-number-of-operations/README.md"
+  },
   {
     "id": "1779",
     "title": {

Diff for: assets/docs/CATEGORIES.md

@@ -64,6 +64,7 @@
 | 1624. [两个相同字符之间的最长子字符串](../../problemset/largest-substring-between-two-equal-characters/README.md) | 简单 |
 | 1640. [能否连接形成数组](../../problemset/check-array-formation-through-concatenation/README.md) | 简单 |
 | 1742. [盒子中小球的最大数量](../../problemset/maximum-number-of-balls-in-a-box/README.md) | 简单 |
+| 1775. [通过最少操作次数使数组的和相等](../../problemset/equal-sum-arrays-with-minimum-number-of-operations/README.md) | 中等 |
 | 1832. [判断句子是否为全字母句](../../problemset/check-if-the-sentence-is-pangram/README.md) | 简单 |
 | 2006. [差的绝对值为 K 的数对数目](../../problemset/count-number-of-pairs-with-absolute-difference-k/README.md) | 简单 |
 | 2013. [检测正方形](../../problemset/detect-squares/README.md) | 中等 |
@@ -755,6 +756,7 @@
 | 1413. [逐步求和得到正数的最小值](../../problemset/minimum-value-to-get-positive-step-by-step-sum/README.md) | 简单 |
 | 1663. [具有给定数值的最小字符串](../../problemset/smallest-string-with-a-given-numeric-value/README.md) | 中等 |
 | 1710. [卡车上的最大单元数](../../problemset/maximum-units-on-a-truck/README.md) | 简单 |
+| 1775. [通过最少操作次数使数组的和相等](../../problemset/equal-sum-arrays-with-minimum-number-of-operations/README.md) | 中等 |
 | 2038. [如果相邻两个颜色均相同则删除当前颜色](../../problemset/remove-colored-pieces-if-both-neighbors-are-the-same-color/README.md) | 中等 |
 
 ## 二叉树

Diff for: assets/docs/TOPICS.md

@@ -1044,6 +1044,8 @@
 
 [1774. 最接近目标价格的甜点成本](../../problemset/closest-dessert-cost/README.md)
 
+[1775. 通过最少操作次数使数组的和相等](../../problemset/equal-sum-arrays-with-minimum-number-of-operations/README.md)
+
 [1779. 找到最近的有相同 X 或 Y 坐标的点](../../problemset/find-nearest-point-that-has-the-same-x-or-y-coordinate/README.md)
 
 [1784. 检查二进制字符串字段](../../problemset/check-if-binary-string-has-at-most-one-segment-of-ones/README.md)

Diff for: problemset/equal-sum-arrays-with-minimum-number-of-operations/README.md

@@ -0,0 +1,96 @@
+# 通过最少操作次数使数组的和相等
+
+> 难度：中等
+>
+> https://leetcode.cn/problems/equal-sum-arrays-with-minimum-number-of-operations/
+
+## 题目
+
+给你两个长度可能不等的整数数组 `nums1` 和 `nums2` 。两个数组中的所有值都在 `1` 到 `6` 之间（包含 `1` 和 `6`）。
+
+每次操作中，你可以选择 **任意** 数组中的任意一个整数，将它变成 `1` 到 `6` 之间 任意 的值（包含 `1` 和 `6`）。
+
+请你返回使 `nums1` 中所有数的和与 `nums2` 中所有数的和相等的最少操作次数。如果无法使两个数组的和相等，请返回 -1 。
+
+### 示例
+
+#### 示例 1：
+
+```
+输入：nums1 = [1,2,3,4,5,6], nums2 = [1,1,2,2,2,2]
+输出：3
+解释：你可以通过 3 次操作使 nums1 中所有数的和与 nums2 中所有数的和相等。以下数组下标都从 0 开始。
+- 将 nums2[0] 变为 6 。 nums1 = [1,2,3,4,5,6], nums2 = [6,1,2,2,2,2] 。
+- 将 nums1[5] 变为 1 。 nums1 = [1,2,3,4,5,1], nums2 = [6,1,2,2,2,2] 。
+- 将 nums1[2] 变为 2 。 nums1 = [1,2,2,4,5,1], nums2 = [6,1,2,2,2,2] 。
+```
+
+#### 示例 2：
+
+```
+输入：nums1 = [1,1,1,1,1,1,1], nums2 = [6]
+输出：-1
+解释：没有办法减少 nums1 的和或者增加 nums2 的和使二者相等。
+```
+
+#### 示例 3：
+
+```
+输入：nums1 = [6,6], nums2 = [1]
+输出：3
+解释：你可以通过 3 次操作使 nums1 中所有数的和与 nums2 中所有数的和相等。以下数组下标都从 0 开始。
+- 将 nums1[0] 变为 2 。 nums1 = [2,6], nums2 = [1] 。
+- 将 nums1[1] 变为 2 。 nums1 = [2,2], nums2 = [1] 。
+- 将 nums2[0] 变为 4 。 nums1 = [2,2], nums2 = [4] 。
+```
+
+## 解题
+
+```ts 
+/**
+ * 贪心 + 哈希表
+ * @desc 时间复杂度 O(N+M)  空间复杂度 O(C)
+ * @param nums1
+ * @param nums2
+ * @returns
+ */
+export function minOperations(nums1: number[], nums2: number[]): number {
+  const n = nums1.length; const m = nums2.length
+  if (6 * n < m || 6 * m < n)
+    return -1
+
+  const cnt1: number[] = new Array(7).fill(0)
+  const cnt2: number[] = new Array(7).fill(0)
+  let diff = 0
+  for (const i of nums1) {
+    ++cnt1[i]
+    diff += i
+  }
+  for (const i of nums2) {
+    ++cnt2[i]
+    diff -= i
+  }
+  if (diff === 0)
+    return 0
+
+  if (diff > 0)
+    return help(cnt2, cnt1, diff)
+
+  return help(cnt1, cnt2, -diff)
+
+  function help(h1: number[], h2: number[], diff: number) {
+    const h = new Array(7).fill(0)
+    for (let i = 1; i < 7; ++i) {
+      h[6 - i] += h1[i]
+      h[i - 1] += h2[i]
+    }
+    let res = 0
+    for (let i = 5; i > 0 && diff > 0; --i) {
+      const t = Math.min(Math.floor((diff + i - 1) / i), h[i])
+      res += t
+      diff -= t * i
+    }
+    return res
+  }
+}
+```

Diff for: problemset/equal-sum-arrays-with-minimum-number-of-operations/index.spec.ts

@@ -0,0 +1,16 @@
+import { describe, expect, it } from 'vitest'
+import { minOperations } from '.'
+
+describe('通过最少操作次数使数组的和相等', () => {
+  testCase(minOperations)
+})
+
+function testCase(fn: (nums1: number[], nums2: number[]) => number) {
+  it.each([
+    [[1, 2, 3, 4, 5, 6], [1, 1, 2, 2, 2, 2], 3],
+    [[1, 1, 1, 1, 1, 1, 1], [6], -1],
+    [[6, 6], [1], 3],
+  ])('示例%#', (nums1, nums2, expected) => {
+    expect(fn(nums1, nums2)).toBe(expected)
+  })
+}

Diff for: problemset/equal-sum-arrays-with-minimum-number-of-operations/index.ts

@@ -0,0 +1,46 @@
+/**
+ * 贪心 + 哈希表
+ * @desc 时间复杂度 O(N+M)  空间复杂度 O(C)
+ * @param nums1
+ * @param nums2
+ * @returns
+ */
+export function minOperations(nums1: number[], nums2: number[]): number {
+  const n = nums1.length; const m = nums2.length
+  if (6 * n < m || 6 * m < n)
+    return -1
+
+  const cnt1: number[] = new Array(7).fill(0)
+  const cnt2: number[] = new Array(7).fill(0)
+  let diff = 0
+  for (const i of nums1) {
+    ++cnt1[i]
+    diff += i
+  }
+  for (const i of nums2) {
+    ++cnt2[i]
+    diff -= i
+  }
+  if (diff === 0)
+    return 0
+
+  if (diff > 0)
+    return help(cnt2, cnt1, diff)
+
+  return help(cnt1, cnt2, -diff)
+
+  function help(h1: number[], h2: number[], diff: number) {
+    const h = new Array(7).fill(0)
+    for (let i = 1; i < 7; ++i) {
+      h[6 - i] += h1[i]
+      h[i - 1] += h2[i]
+    }
+    let res = 0
+    for (let i = 5; i > 0 && diff > 0; --i) {
+      const t = Math.min(Math.floor((diff + i - 1) / i), h[i])
+      res += t
+      diff -= t * i
+    }
+    return res
+  }
+}