Improved task 2386.

Author: javadev

README.md

@@ -1848,7 +1848,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
-| 2386 |[Find the K-Sum of an Array](src/main/java/g2301_2400/s2386_find_the_k_sum_of_an_array/Solution.java)| Hard | Array, Sorting, Heap_(Priority_Queue) | 75 | 100.00
+| 2386 |[Find the K-Sum of an Array](src/main/java/g2301_2400/s2386_find_the_k_sum_of_an_array/Solution.java)| Hard | Array, Sorting, Heap_Priority_Queue | 75 | 100.00
 | 2385 |[Amount of Time for Binary Tree to Be Infected](src/main/java/g2301_2400/s2385_amount_of_time_for_binary_tree_to_be_infected/Solution.java)| Medium | Tree, Binary_Tree, Depth_First_Search, Breadth_First_Search | 20 | 100.00
 | 2384 |[Largest Palindromic Number](src/main/java/g2301_2400/s2384_largest_palindromic_number/Solution.java)| Medium | String, Hash_Table, Greedy | 26 | 100.00
 | 2383 |[Minimum Hours of Training to Win a Competition](src/main/java/g2301_2400/s2383_minimum_hours_of_training_to_win_a_competition/Solution.java)| Easy | Array, Greedy | 0 | 100.00

src/main/java/g2301_2400/s2386_find_the_k_sum_of_an_array/Solution.java

@@ -1,6 +1,6 @@
 package g2301_2400.s2386_find_the_k_sum_of_an_array;
 
-// #Hard #Array #Sorting #Heap_(Priority_Queue)
+// #Hard #Array #Sorting #Heap_Priority_Queue
 // #2022_08_25_Time_75_ms_(100.00%)_Space_86.8_MB_(33.33%)
 
 import java.util.Arrays;
@@ -22,14 +22,12 @@ public long kSum(int[] nums, int k) {
         pq.offer(new Pair<>(sum, 0));
         while (k-- > 1) {
             Pair<Long, Integer> top = pq.poll();
-            if (top != null) {
-                long s = top.getKey();
-                int i = top.getValue();
-                if (i < nums.length) {
-                    pq.offer(new Pair<>(s - nums[i], i + 1));
-                    if (i > 0) {
-                        pq.offer(new Pair<>(s - nums[i] + nums[i - 1], i + 1));
-                    }
+            long s = top.getKey();
+            int i = top.getValue();
+            if (i < nums.length) {
+                pq.offer(new Pair<>(s - nums[i], i + 1));
+                if (i > 0) {
+                    pq.offer(new Pair<>(s - nums[i] + nums[i - 1], i + 1));
                 }
             }
         }

src/test/java/g2301_2400/s2386_find_the_k_sum_of_an_array/SolutionTest.java

@@ -15,4 +15,11 @@ void kSum() {
     void kSum2() {
         assertThat(new Solution().kSum(new int[] {1, -2, 3, 4, -10, 12}, 16), equalTo(10L));
     }
+
+    @Test
+    void kSum3() {
+        assertThat(
+                new Solution().kSum(new int[] {-530219056, 353285209, 493533664}, 6),
+                equalTo(-36685392L));
+    }
 }