Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit44c81f5

Browse files
authored
Fixed Idea warnings
1 parent0137c61 commit44c81f5

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
publicclassSolution {
99
privateintgetMax(int[]nums,intl,intr) {
1010
intmax = -1;
11-
intcurr = -1;
11+
intcurr;
1212
for (inti =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
publicclassMyHashMap {
10-
privateArrayList[]arr =null;
10+
privatefinalArrayList[]arr;
1111

1212
publicMyHashMap() {
1313
arr =newArrayList[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
publicclassSolution {
66
publicintsumBase(intn,intk) {
7-
inta =0;
7+
inta;
88
intsum =0;
9-
intb =0;
9+
intb;
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-
intstart =0;
35+
intstart;
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
publicintsecondsToRemoveOccurrences(Strings) {
88
intlastOne = -1;
99
intresult =0;
10-
intprevResult =0;
10+
intprevResult;
1111
intcurResult =0;
1212
intcountOne =0;
1313
intcountZero =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 (charc :num.toCharArray()) {
1212
count[c -'0']++;
1313
}
14-
intc =0;
14+
intc;
1515
for (inti =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 =newStringBuilder(first.toString());
2929
if (center != -1) {
3030
first.append(center);
3131
}
32-
first.append(second.reverse().toString());
33-
returnfirst.length() ==0 ?"0" :first.toString();
32+
first.append(second.reverse());
33+
returnfirst.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
publicintmatchPlayersAndTrainers(int[]players,int[]trainers) {
1111
Arrays.sort(players);
1212
Arrays.sort(trainers);
13-
inti =0;
13+
inti;
1414
intj =0;
1515
intcount =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
publicclassSolution {
77
publicString[]splitMessage(Stringmessage,intlimit) {
8-
inttotal =0;
8+
inttotal;
99
intrunning =0;
1010
intcount;
1111
inttotalReq;

‎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
publicclassSolution {
66
publicintlongestString(intx,inty,intz) {
77
intmin =Math.min(x,y);
8-
intres =0;
8+
intres;
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 =newint[yLen *xLen];
2424
int[]root =newint[yLen *xLen];
25-
inthead = -1;
25+
inthead;
2626
inttail = -1;
2727
intqIdx = -1;
2828
intend =yLen *xLen -1;

‎src/main/java/g2801_2900/s2816_double_a_number_represented_as_a_linked_list/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -40,7 +40,7 @@ public ListNode doubleIt(ListNode head) {
4040

4141
privateListNoderevList(ListNodehead) {
4242
ListNodeprev =null;
43-
ListNodenxt =null;
43+
ListNodenxt;
4444
ListNodecurrent =head;
4545
while (current !=null) {
4646
nxt =current.next;

‎src/main/java/g2901_3000/s2932_maximum_strong_pair_xor_i/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
publicclassSolution {
77
publicintmaximumStrongPairXor(int[]nums) {
88
intmax =0;
9-
intpair =0;
9+
intpair;
1010
for (inti =0;i <nums.length;i++) {
1111
for (intj =i;j <nums.length;j++) {
1212
if (Math.abs(nums[i] -nums[j]) <=Math.min(nums[i],nums[j])) {

‎src/main/java/g2901_3000/s2972_count_the_number_of_incremovable_subarrays_ii/Solution.java

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

55
publicclassSolution {
66
publiclongincremovableSubarrayCount(int[]nums) {
7-
longans =0;
7+
longans;
88
intn =nums.length;
99
intl =0;
1010
intr =n -1;

‎src/main/java/g3101_3200/s3108_minimum_cost_walk_in_weighted_graph/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@ public int[] minimumCost(int n, int[][] edges, int[][] query) {
2424
if (parent1 ==parent2) {
2525
bitwise[parent1] &=weight;
2626
}else {
27-
intbitwiseVal =0;
27+
intbitwiseVal;
2828
booleancheck1 =bitwise[parent1] == -1;
2929
booleancheck2 =bitwise[parent2] == -1;
3030
if (check1 &&check2) {

‎src/main/java/g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i/Solution.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -8,14 +8,14 @@
88

99
publicclassSolution {
1010
privatestaticfinalintMOD = (int)1e9 +7;
11-
privatelong[]c2 =newlong[1001];
11+
privatefinallong[]c2 =newlong[1001];
1212

1313
publicintsubsequencesWithMiddleMode(int[]nums) {
1414
if (c2[2] ==0) {
1515
c2[0] =c2[1] =0;
1616
c2[2] =1;
1717
for (inti =3;i <c2.length; ++i) {
18-
c2[i] =i * (i -1) /2;
18+
c2[i] =(long)i * (i -1) /2;
1919
}
2020
}
2121
intn =nums.length;
@@ -59,8 +59,8 @@ public int subsequencesWithMiddleMode(int[] nums) {
5959
ans -=
6060
leftY
6161
*rightY
62-
* (leftX * (right -rightX -rightY)
63-
+rightX * (left -leftX -leftY));
62+
* ((long)leftX * (right -rightX -rightY)
63+
+(long)rightX * (left -leftX -leftY));
6464
}
6565
}
6666
leftCount[x]++;

‎src/main/java/g3401_3500/s3407_substring_matching_pattern/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@ public boolean hasMatch(String s, String p) {
2222
privateintfun(Strings,Stringk) {
2323
intn =s.length();
2424
intm =k.length();
25-
intj =0;
25+
intj;
2626
for (inti =0;i <=n -m;i++) {
2727
for (j =0;j <m;j++) {
2828
charch1 =s.charAt(j +i);

‎src/main/java/g3401_3500/s3424_minimum_cost_to_make_arrays_identical/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ public class Solution {
88
publiclongminCost(int[]arr,int[]brr,longk) {
99
intn =arr.length;
1010
longsum1 =0;
11-
longsum2 =0;
11+
longsum2;
1212
for (inti =0;i <n;i++) {
1313
sum1 +=Math.abs(arr[i] -brr[i]);
1414
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp