feat: add javascript solution to lc problem: No.2233

No.2233.Maximum Product After K Increments

Author: zhaocchen

solution/2200-2299/2233.Maximum Product After K Increments/README.md

@@ -63,10 +63,30 @@
 
 ```
 
-### **TypeScript**
-
-```ts
-
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var maximumProduct = function(nums, k) {
+    const n = nums.length;
+    let pq = new MinPriorityQueue();
+    for (let i = 0; i < n; i++) {
+        pq.enqueue(nums[i]);
+    }
+    for (let i = 0; i < k; i++) {
+        pq.enqueue(pq.dequeue().element + 1);
+    }
+    let ans = 1;
+    const limit = 10 ** 9 + 7;
+    for (let i = 0; i < n; i++) {
+        ans = ans * pq.dequeue().element % limit;
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2233.Maximum Product After K Increments/README_EN.md

@@ -56,10 +56,30 @@ Note that there may be other ways to increment nums to have the maximum product.
 
 ```
 
-### **TypeScript**
-
-```ts
-
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var maximumProduct = function(nums, k) {
+    const n = nums.length;
+    let pq = new MinPriorityQueue();
+    for (let i = 0; i < n; i++) {
+        pq.enqueue(nums[i]);
+    }
+    for (let i = 0; i < k; i++) {
+        pq.enqueue(pq.dequeue().element + 1);
+    }
+    let ans = 1;
+    const limit = 10 ** 9 + 7;
+    for (let i = 0; i < n; i++) {
+        ans = ans * pq.dequeue().element % limit;
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2233.Maximum Product After K Increments/Solution.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+ var maximumProduct = function(nums, k) {
+    const n = nums.length;
+    let pq = new MinPriorityQueue();
+    for (let i = 0; i < n; i++) {
+        pq.enqueue(nums[i]);
+    }
+    for (let i = 0; i < k; i++) {
+        pq.enqueue(pq.dequeue().element + 1);
+    }
+    let ans = 1;
+    const limit = 10 ** 9 + 7;
+    for (let i = 0; i < n; i++) {
+        ans = ans * pq.dequeue().element % limit;
+    }
+    return ans;
+};