We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0544ede commit 48f8168Copy full SHA for 48f8168
src/main/java/g1701_1800/s1755_closest_subsequence_sum/Solution.java
@@ -5,14 +5,15 @@
5
6
import java.util.Arrays;
7
8
+@SuppressWarnings("java:S2184")
9
public class Solution {
10
private int idx;
11
private int sum;
12
13
public int minAbsDifference(int[] nums, int goal) {
14
int n = nums.length;
15
int nFirst = (int) Math.pow(2, (double) n / 2);
- int nSecond = (int) Math.pow(2, (double) (n - n / 2));
16
+ int nSecond = (int) Math.pow(2, n - n / 2);
17
int[] first = new int[nFirst];
18
int[] second = new int[nSecond];
19
helper(nums, first, 0, n / 2 - 1);
0 commit comments