Skip to content

Commit 44c81f5

Browse files
authored
Fixed Idea warnings
1 parent 0137c61 commit 44c81f5

File tree

17 files changed

+25
-25
lines changed

17 files changed

+25
-25
lines changed

src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
public class Solution {
99
private int getMax(int[] nums, int l, int r) {
1010
int max = -1;
11-
int curr = -1;
11+
int curr;
1212
for (int i = l; i <= r; i++) {
1313
curr = i + nums[i];
1414
max = Math.max(max, curr);

src/main/java/g0701_0800/s0706_design_hashmap/MyHashMap.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77

88
@SuppressWarnings("unchecked")
99
public class MyHashMap {
10-
private ArrayList[] arr = null;
10+
private final ArrayList[] arr;
1111

1212
public MyHashMap() {
1313
arr = new ArrayList[1000];

src/main/java/g1801_1900/s1837_sum_of_digits_in_base_k/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,9 +4,9 @@
44

55
public class Solution {
66
public int sumBase(int n, int k) {
7-
int a = 0;
7+
int a;
88
int sum = 0;
9-
int b = 0;
9+
int b;
1010
while (n != 0) {
1111
a = n % k;
1212
b = n / k;

src/main/java/g2301_2400/s2332_the_latest_time_to_catch_a_bus/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,7 @@ public int latestTimeCatchTheBus(int[] buses, int[] passengers, int capacity) {
3232
b++;
3333
}
3434
}
35-
int start = 0;
35+
int start;
3636
if (c == capacity) {
3737
// capcity is full in last bus, find time last passenger might have boarded
3838
start = Math.min(passengers[p - 1], buses[blen - 1]);

src/main/java/g2301_2400/s2380_time_needed_to_rearrange_a_binary_string/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ public class Solution {
77
public int secondsToRemoveOccurrences(String s) {
88
int lastOne = -1;
99
int result = 0;
10-
int prevResult = 0;
10+
int prevResult;
1111
int curResult = 0;
1212
int countOne = 0;
1313
int countZero = 0;

src/main/java/g2301_2400/s2384_largest_palindromic_number/Solution.java

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -11,25 +11,25 @@ public String largestPalindromic(String num) {
1111
for (char c : num.toCharArray()) {
1212
count[c - '0']++;
1313
}
14-
int c = 0;
14+
int c;
1515
for (int i = 9; i >= 0; i--) {
1616
c = 0;
1717
if (count[i] % 2 == 1 && center == -1) {
1818
center = i;
1919
}
20-
if (first.length() == 0 && i == 0) {
20+
if (first.isEmpty() && i == 0) {
2121
continue;
2222
}
2323
while (c < count[i] / 2) {
24-
first.append(String.valueOf(i));
24+
first.append(i);
2525
c++;
2626
}
2727
}
2828
second = new StringBuilder(first.toString());
2929
if (center != -1) {
3030
first.append(center);
3131
}
32-
first.append(second.reverse().toString());
33-
return first.length() == 0 ? "0" : first.toString();
32+
first.append(second.reverse());
33+
return first.isEmpty() ? "0" : first.toString();
3434
}
3535
}

src/main/java/g2401_2500/s2410_maximum_matching_of_players_with_trainers/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ public class Solution {
1010
public int matchPlayersAndTrainers(int[] players, int[] trainers) {
1111
Arrays.sort(players);
1212
Arrays.sort(trainers);
13-
int i = 0;
13+
int i;
1414
int j = 0;
1515
int count = 0;
1616
i = 0;

src/main/java/g2401_2500/s2468_split_message_based_on_limit/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
@SuppressWarnings("java:S3518")
66
public class Solution {
77
public String[] splitMessage(String message, int limit) {
8-
int total = 0;
8+
int total;
99
int running = 0;
1010
int count;
1111
int totalReq;

src/main/java/g2701_2800/s2745_construct_the_longest_new_string/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
public class Solution {
66
public int longestString(int x, int y, int z) {
77
int min = Math.min(x, y);
8-
int res = 0;
8+
int res;
99
if (x == y) {
1010
res = 2 * min + z;
1111
} else {

src/main/java/g2801_2900/s2812_find_the_safest_path_in_a_grid/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@ public int maximumSafenessFactor(List<List<Integer>> grid) {
2222
int[] tmpDeque;
2323
int[] queue = new int[yLen * xLen];
2424
int[] root = new int[yLen * xLen];
25-
int head = -1;
25+
int head;
2626
int tail = -1;
2727
int qIdx = -1;
2828
int end = yLen * xLen - 1;

0 commit comments

Comments
 (0)