📌 📄 内容摘要:
@Myqwn2729 在 连o1-preview都无法解决的LeetCode算法问题-欢迎佬友们试试 中发帖
You are given an integer array `nums`, an integer `k`, and an integer `multiplier`.
You need to perform `k` operations on `nums`. In each operation:
- Find the **minimum** value `x` in `nums`. If there are multiple occurrences of the minimum value, select the one that appears **first**.
- Replace the selected minimum value `x` with `x * multiplier`.
After the `k` operations, apply **modulo** `1...
────────── 链接信息 ──────────
🔗 论坛链接: linux.do
📎 访问地址: https://linux.do/t/topic/217737/1
─────────────────────────────
📢 来源：LINUX DO
