Added task 2233.

Author: javadev

README.md

@@ -1384,6 +1384,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
 | 2236 |[Root Equals Sum of Children](src/main/java/g2201_2300/s2236_root_equals_sum_of_children/Solution.java)| Easy | Tree, Binary_Tree | 0 | 100.00
 | 2235 |[Add Two Integers](src/main/java/g2201_2300/s2235_add_two_integers/Solution.java)| Easy | Math | 1 | 48.94
 | 2234 |[Maximum Total Beauty of the Gardens](src/main/java/g2201_2300/s2234_maximum_total_beauty_of_the_gardens/Solution.java)| Hard | Array, Sorting, Greedy, Binary_Search, Two_Pointers | 63 | 73.03
+| 2233 |[Maximum Product After K Increments](src/main/java/g2201_2300/s2233_maximum_product_after_k_increments/Solution.java)| Medium | Array, Greedy, Heap_Priority_Queue | 364 | 75.06
 | 2232 |[Minimize Result by Adding Parentheses to Expression](src/main/java/g2201_2300/s2232_minimize_result_by_adding_parentheses_to_expression/Solution.java)| Medium | String, Enumeration | 1 | 99.60
 | 2231 |[Largest Number After Digit Swaps by Parity](src/main/java/g2201_2300/s2231_largest_number_after_digit_swaps_by_parity/Solution.java)| Easy | Sorting, Heap_Priority_Queue | 1 | 98.32
 | 2227 |[Encrypt and Decrypt Strings](src/main/java/g2201_2300/s2227_encrypt_and_decrypt_strings/Encrypter.java)| Hard | Array, String, Hash_Table, Design, Trie | 143 | 74.74

src/main/java/g2201_2300/s2233_maximum_product_after_k_increments/Solution.java

@@ -0,0 +1,24 @@
+package g2201_2300.s2233_maximum_product_after_k_increments;
+
+// #Medium #Array #Greedy #Heap_Priority_Queue
+// #2022_06_14_Time_364_ms_(75.06%)_Space_52.3_MB_(95.74%)
+
+import java.util.PriorityQueue;
+
+public class Solution {
+ public int maximumProduct(int[] nums, int k) {
+ PriorityQueue<Integer> pq = new PriorityQueue<>();
+ for (int num : nums) {
+ pq.add(num);
+ }
+ while (k-- > 0) {
+ pq.add(pq.poll() + 1);
+ }
+ long ans = 1;
+ int mod = 1000000007;
+ while (!pq.isEmpty()) {
+ ans = (ans * pq.poll()) % mod;
+ }
+ return (int) ans;
+ }
+}

src/main/java/g2201_2300/s2233_maximum_product_after_k_increments/readme.md

@@ -0,0 +1,40 @@
+2233\. Maximum Product After K Increments
+
+Medium
+
+You are given an array of non-negative integers `nums` and an integer `k`. In one operation, you may choose **any** element from `nums` and **increment** it by `1`.
+
+Return _the **maximum** **product** of_ `nums` _after **at most**_ `k` _operations._ Since the answer may be very large, return it **modulo** <code>10<sup>9</sup> + 7</code>. Note that you should maximize the product before taking the modulo.
+
+**Example 1:**
+
+**Input:** nums = [0,4], k = 5
+
+**Output:** 20
+
+**Explanation:** Increment the first number 5 times.
+
+Now nums = [5, 4], with a product of 5 \* 4 = 20.
+
+It can be shown that 20 is maximum product possible, so we return 20.
+
+Note that there may be other ways to increment nums to have the maximum product.
+
+**Example 2:**
+
+**Input:** nums = [6,3,3,2], k = 2
+
+**Output:** 216
+
+**Explanation:** Increment the second number 1 time and increment the fourth number 1 time.
+
+Now nums = [6, 4, 3, 3], with a product of 6 \* 4 \* 3 \* 3 = 216.
+
+It can be shown that 216 is maximum product possible, so we return 216.
+
+Note that there may be other ways to increment nums to have the maximum product.
+
+**Constraints:**
+
+* <code>1 <= nums.length, k <= 10<sup>5</sup></code>
+* <code>0 <= nums[i] <= 10<sup>6</sup></code>

src/test/java/g2201_2300/s2233_maximum_product_after_k_increments/SolutionTest.java

@@ -0,0 +1,18 @@
+package g2201_2300.s2233_maximum_product_after_k_increments;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import org.junit.jupiter.api.Test;
+
+class SolutionTest {
+ @Test
+ void maximumProduct() {
+ assertThat(new Solution().maximumProduct(new int[] {0, 4}, 5), equalTo(20));
+ }
+
+ @Test
+ void maximumProduct2() {
+ assertThat(new Solution().maximumProduct(new int[] {6, 3, 3, 2}, 2), equalTo(216));
+ }
+}