https://leetcode.cn/problems/append-k-integers-with-minimal-sum/

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/append-k-integers-with-minimal-sum/
+
 https://leetcode.cn/problems/inorder-successor-in-bst-ii/
 
 https://leetcode.cn/problems/check-if-two-string-arrays-are-equivalent/

append-k-integers-with-minimal-sum/index.ts

@@ -0,0 +1,15 @@
+export default function minimalKSum(nums: number[], k: number): number {
+    nums = [...new Set(nums)].sort((a, b) => a - b);
+    const n: number = nums.length;
+    let exist: number = 0;
+    for (let i: number = 0; i < n; i++) {
+        if (nums[i] <= k) {
+            k++;
+            exist += nums[i];
+        } else {
+            break;
+        }
+    }
+
+    return k * (k + 1) / 2 - exist;
+}

check-if-two-string-arrays-are-equivalent/index.ts

@@ -1,6 +1,6 @@
-export default function arrayStringsAreEqual(
-    word1: string[],
-    word2: string[],
-): boolean {
-    return word1.join("") === word2.join("");
-}
+export default function arrayStringsAreEqual(
+    word1: string[],
+    word2: string[],
+): boolean {
+    return word1.join("") === word2.join("");
+}