[LEET-3318] fix build

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/fourththousand/_3318.java

@@ -7,7 +7,13 @@
 public class _3318 {
     public static class Solution1 {
         public int[] findXSum(int[] nums, int k, int x) {
-            PriorityQueue<int[]> maxHeap = new PriorityQueue<>((a, b) -> a[1] != b[1] ? b[1] - a[1] : b[0] - a[0]);//a[0] is the number itself, a[1] is the frequency
+            PriorityQueue<int[]> maxHeap =
+                    new PriorityQueue<>(
+                            (a, b) ->
+                                    a[1] != b[1]
+                                            ? b[1] - a[1]
+                                            : b[0] - a[0]); // a[0] is the number itself, a[1]
+            // is the frequency
             Map<Integer, int[]> map = new HashMap<>();
             int i = 0;
             for (; i < k; i++) {

src/test/java/com/fishercoder/fourththousand/_3318Test.java

@@ -1,11 +1,11 @@
 package com.fishercoder.fourththousand;
 
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
 import com.fishercoder.solutions.fourththousand._3318;
 import org.junit.jupiter.api.BeforeEach;
 import org.junit.jupiter.api.Test;
 
-import static org.junit.jupiter.api.Assertions.assertArrayEquals;
-
 public class _3318Test {
 
     private _3318.Solution1 solution1;
@@ -18,13 +18,13 @@ public void setup() {
 
     @Test
     public void test1() {
-        nums = new int[]{1, 1, 2, 2, 3, 4, 2, 3};
-        assertArrayEquals(new int[]{6, 10, 12}, solution1.findXSum(nums, 6, 2));
+        nums = new int[] {1, 1, 2, 2, 3, 4, 2, 3};
+        assertArrayEquals(new int[] {6, 10, 12}, solution1.findXSum(nums, 6, 2));
     }
 
     @Test
     public void test2() {
-        nums = new int[]{3, 8, 7, 8, 7, 5};
-        assertArrayEquals(new int[]{11, 15, 15, 15, 12}, solution1.findXSum(nums, 2, 2));
+        nums = new int[] {3, 8, 7, 8, 7, 5};
+        assertArrayEquals(new int[] {11, 15, 15, 15, 12}, solution1.findXSum(nums, 2, 2));
     }
 }