LeetCode每日一题(2195. Append K Integers With Minimal Sum)

You are given an integer array nums and an integer k. Append k unique positive integers that do not appear in nums to nums such that the resulting total sum is minimum.

Return the sum of the k integers appended to nums.

Example 1:

Input: nums = [1,4,25,10,25], k = 2
Output: 5

Explanation: The two unique positive integers that do not appear in nums which we append are 2 and 3.
The resulting sum of nums is 1 + 4 + 25 + 10 + 25 + 2 + 3 = 70, which is the minimum.
The sum of the two integers appended is 2 + 3 = 5, so we return 5.

Example 2:

Input: nums = [5,6], k = 6
Output: 25

Explanation: The six unique positive integers that do not appear in nums which we append are 1, 2, 3, 4, 7, and 8.
The resulting sum of nums is 5 + 6 + 1 + 2 + 3 + 4 + 7 + 8 = 36, which is the minimum.
The sum of the six integers appended is 1 + 2 + 3 + 4 + 7 + 8 = 25, so we return 25.

Constraints:

• 1 <= nums.length <= 105
• 1 <= nums[i] <= 109
• 1 <= k <= 108

---

1. 将 nums 排序
2. nums 中相邻两个数之间的间隙，将这些间隙加起来, 例如 1, 4 之间的间隙就是 2, 3, 加和就是 2 + 3 = 5
3. 需要注意的是数量 k， 如果数量 k 大于 nums 中所有间隙数字的数量那就需要用 max(nums)之后的数字来填补这个数量差， 如果 k 小于 nums 中所有间隙数字在的数量那就有可能某个间隙数字不能全部加到答案中

---

impl Solution {
   
    pub fn minimal_k_sum(mut nums: Vec<i32>