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

Commit65b9f12

Browse files
authored
Fixed idea warnings.
1 parent87560b7 commit65b9f12

File tree

34 files changed

+59
-53
lines changed

34 files changed

+59
-53
lines changed

‎build.gradle

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -50,6 +50,7 @@ spotless {
5050
encoding'UTF-8'
5151
target fileTree(projectDir) {
5252
include'**/src/**/*.java'
53+
exclude'**/build/**'
5354
}
5455
importOrder'\\#','','*'
5556
removeUnusedImports()

‎src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,8 +9,8 @@ public double findMedianSortedArrays(int[] nums1, int[] nums2) {
99
if (nums2.length <nums1.length) {
1010
returnfindMedianSortedArrays(nums2,nums1);
1111
}
12-
intcut1 =0;
13-
intcut2 =0;
12+
intcut1;
13+
intcut2;
1414
intn1 =nums1.length;
1515
intn2 =nums2.length;
1616
intlow =0;

‎src/main/java/g0301_0400/s0367_valid_perfect_square/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ public boolean isPerfectSquare(int num) {
1212
// long datatype can holds huge number.
1313
longstart =0;
1414
longend =num;
15-
longmid =0;
15+
longmid;
1616
while (start <=end) {
1717
// until start is lesser or equal to end do this
1818
// Finding middle value

‎src/main/java/g0301_0400/s0388_longest_absolute_file_path/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ public int lengthLongestPath(String input) {
1111
intlongestLen =0;
1212
intcurrDirLen =0;
1313
inti =0;
14-
intcurrLevel =0;
14+
intcurrLevel;
1515
intnextLevel =0;
1616
booleanisFile =false;
1717
Characterperiod ='.';

‎src/main/java/g0301_0400/s0397_integer_replacement/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ private int solve(int n, Map<Integer, Integer> dp) {
1919
if (dp.containsKey(n)) {
2020
returndp.get(n);
2121
}
22-
intans =0;
22+
intans;
2323
if (n %2 ==0) {
2424
ans =1 +solve(n >>>1,dp);
2525
}else {

‎src/main/java/g0501_0600/s0537_complex_number_multiplication/Solution.java

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

55
publicclassSolution {
66
publicStringcomplexNumberMultiply(Stringnum1,Stringnum2) {
7-
intcountReal =0;
8-
intcountImagine =0;
7+
intcountReal;
8+
intcountImagine;
99
int[]arr1 =newint[2];
1010
int[]arr2 =newint[2];
1111

‎src/main/java/g0501_0600/s0546_remove_boxes/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,7 @@ private int helper(int[] boxes, int left, int right, int count) {
2525
leftDash++;
2626
countDash++;
2727
}
28-
intans =0;
28+
intans;
2929
ans =helper(boxes,leftDash +1,right,0) + (countDash +1) * (countDash +1);
3030
for (inti =leftDash +1;i <=right;i++) {
3131
if (boxes[i] ==boxes[leftDash]) {

‎src/main/java/g0501_0600/s0557_reverse_words_in_a_string_iii/Solution.java

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

66
publicclassSolution {
77
publicStringreverseWords(Strings) {
8-
intl =0;
8+
intl;
99
intr =0;
1010
intlen =s.length();
1111
char[]ch =s.toCharArray();

‎src/main/java/g0501_0600/s0565_array_nesting/Solution.java

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

55
publicclassSolution {
66
publicintarrayNesting(int[]nums) {
7-
intindex = -1;
8-
intvalue =0;
7+
intindex;
8+
intvalue;
99
intmaxLen =0;
10-
intlen =0;
10+
intlen;
1111
for (inti =0;i <nums.length;i++) {
1212
if (nums[i] != -1) {
1313
index =i;

‎src/main/java/g0701_0800/s0784_letter_case_permutation/Solution.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -20,13 +20,13 @@ public void helper(String s, int curr, String temp) {
2020
return;
2121
}
2222
if (Character.isDigit(s.charAt(curr))) {
23-
helper(s,curr +1,temp +s.substring(curr,curr +1));
23+
helper(s,curr +1,temp +s.charAt(curr));
2424
}else {
2525
if (Character.isLowerCase(s.charAt(curr))) {
26-
helper(s,curr +1,temp +s.substring(curr,curr +1));
26+
helper(s,curr +1,temp +s.charAt(curr));
2727
helper(s,curr +1,temp + (s.substring(curr,curr +1)).toUpperCase());
2828
}else {
29-
helper(s,curr +1,temp +s.substring(curr,curr +1));
29+
helper(s,curr +1,temp +s.charAt(curr));
3030
helper(s,curr +1,temp + (s.substring(curr,curr +1)).toLowerCase());
3131
}
3232
}

‎src/main/java/g0801_0900/s0849_maximize_distance_to_closest_person/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ private void extend(int[] seats, int position) {
3535
break;
3636
}
3737
}
38-
intmaxReach =0;
38+
intmaxReach;
3939
if (position ==0) {
4040
maxReach =rightMinDistance;
4141
}elseif (position ==seats.length -1) {

‎src/main/java/g0801_0900/s0859_buddy_strings/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
publicclassSolution {
66
publicbooleanbuddyStrings(Strings,Stringgoal) {
77
intfirst = -1;
8-
intsecond = -1;
8+
intsecond;
99
int[]sCounts =newint[26];
1010
if (s.equals(goal)) {
1111
for (inti =0;i <s.length();i++) {

‎src/main/java/g0901_1000/s0920_number_of_music_playlists/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ private long helper(int songNumber, int l, int usedSong, int n, int k, long[][]
2121
if (dp[songNumber][usedSong] != -1) {
2222
returndp[songNumber][usedSong];
2323
}
24-
longans =0;
24+
longans;
2525
if (songNumber <k) {
2626
ans = (n -usedSong) *helper(songNumber +1,l,usedSong +1,n,k,dp);
2727
}elseif (usedSong ==n) {

‎src/main/java/g0901_1000/s0957_prison_cells_after_n_days/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ public int[] prisonAfterNDays(int[] cells, int n) {
1212
}
1313
int[]first =null;
1414
int[]prev =cells;
15-
intperiod = -1;
15+
intperiod;
1616
intday =0;
1717
while (n >0) {
1818
day++;

‎src/main/java/g1001_1100/s1006_clumsy_factorial/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ public class Solution {
66
privateintm =1;
77

88
publicintclumsy(intn) {
9-
intnum =0;
9+
intnum;
1010
if (n >=4) {
1111
num =m *n * (n -1) / (n -2) + (n -3);
1212
}elseif (n ==3) {

‎src/main/java/g1001_1100/s1007_minimum_domino_rotations_for_equal_row/Solution.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -7,8 +7,8 @@ public int minDominoRotations(int[] tops, int[] bottoms) {
77
inttop =tops[0];
88
inttCount =0;
99
intbCount =0;
10-
inttSwaps =0;
11-
intbSwaps =0;
10+
inttSwaps;
11+
intbSwaps;
1212
intswaps =0;
1313
booleanvalid =true;
1414
for (inti =0;i <tops.length;i++) {
@@ -32,8 +32,8 @@ public int minDominoRotations(int[] tops, int[] bottoms) {
3232
intbottom =bottoms[0];
3333
inttCount1 =0;
3434
intbCount1 =0;
35-
inttSwaps1 =0;
36-
intbSwaps1 =0;
35+
inttSwaps1;
36+
intbSwaps1;
3737
intswaps1 =0;
3838
booleanvalid1 =true;
3939
for (inti =0;i <bottoms.length;i++) {

‎src/main/java/g1001_1100/s1012_numbers_with_repeated_digits/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ public class Solution {
1010

1111
publicintnumDupDigitsAtMostN(intn) {
1212
intnStrLength =String.valueOf(n).length();
13-
intallNineLength =0;
13+
intallNineLength;
1414
if (n <0 ||nStrLength <2) {
1515
return0;
1616
}elseif (Math.pow(10,nStrLength) -1 ==n) {

‎src/main/java/g1001_1100/s1021_remove_outermost_parentheses/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,7 @@ public String removeOuterParentheses(String s) {
2525
}
2626
StringBuildersb =newStringBuilder();
2727
for (Stringprimitive :primitives) {
28-
sb.append(primitive.substring(1,primitive.length() -1));
28+
sb.append(primitive,1,primitive.length() -1);
2929
}
3030
returnsb.toString();
3131
}

‎src/main/java/g1001_1100/s1040_moving_stones_until_consecutive_ii/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -29,7 +29,7 @@ public int[] numMovesStonesII(int[] stones) {
2929
j++;
3030
}
3131
ans[0] =minMoves;
32-
intmaxMoves =0;
32+
intmaxMoves;
3333
if (stones[1] ==stones[0] +1 ||stones[n -1] ==stones[n -2] +1) {
3434
maxMoves =stones[n -1] -stones[0] +1 -n;
3535
}else {

‎src/main/java/g1101_1200/s1106_parsing_a_boolean_expression/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@ public boolean parseBoolExpr(String expression) {
1818
}
1919

2020
privatebooleanexpr() {
21-
booleanres =false;
21+
booleanres;
2222
if (match('!')) {
2323
res =not();
2424
}elseif (match('&')) {

‎src/main/java/g1401_1500/s1423_maximum_points_you_can_obtain_from_cards/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
publicclassSolution {
66
publicintmaxScore(int[]cardPoints,intk) {
77
intcurrSum =0;
8-
intmaxSum =0;
8+
intmaxSum;
99
for (inti =0;i <k;i++) {
1010
currSum +=cardPoints[i];
1111
}

‎src/main/java/g1401_1500/s1436_destination_city/Solution.java

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -9,12 +9,12 @@
99
publicclassSolution {
1010
publicStringdestCity(List<List<String>>paths) {
1111
Set<String>set =newHashSet<>();
12-
for (inti =0;i <paths.size();i++) {
13-
set.add(paths.get(i).get(0));
12+
for (List<String>strings :paths) {
13+
set.add(strings.get(0));
1414
}
15-
for (inti =0;i <paths.size();i++) {
16-
if (!set.contains(paths.get(i).get(1))) {
17-
returnpaths.get(i).get(1);
15+
for (List<String>path :paths) {
16+
if (!set.contains(path.get(1))) {
17+
returnpath.get(1);
1818
}
1919
}
2020
return"";

‎src/main/java/g1601_1700/s1620_coordinate_with_maximum_network_quality/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ public class Solution {
66
publicint[]bestCoordinate(int[][]towers,intradius) {
77
int[]res =newint[2];
88
doublemaxQuality =0;
9-
doublequality =0;
9+
doublequality;
1010
intfinalX =0;
1111
intfinalY =0;
1212
for (inti =0;i <51;i++) {

‎src/main/java/g1601_1700/s1672_richest_customer_wealth/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,8 +8,8 @@ public int maximumWealth(int[][] accounts) {
88
intmax =Integer.MIN_VALUE;
99
for (int[]account :accounts) {
1010
intsum =0;
11-
for (intj =0;j <account.length;j++) {
12-
sum +=account[j];
11+
for (inti :account) {
12+
sum +=i;
1313
}
1414
max =Math.max(max,sum);
1515
}

‎src/main/java/g1701_1800/s1742_maximum_number_of_balls_in_a_box/Solution.java

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

55
publicclassSolution {
66
publicintcountBalls(intlowLimit,inthighLimit) {
7-
intmaxValue =0;
7+
intmaxValue;
88
int[]countArray =newint[46];
99
intcurrentSum =getDigitSum(lowLimit);
1010
countArray[currentSum]++;

‎src/main/java/g1701_1800/s1793_maximum_score_of_a_good_subarray/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ public int maximumScore(int[] nums, int k) {
99
intj =k;
1010
intres =nums[k];
1111
intmin =nums[k];
12-
booleangoLeft =true;
12+
booleangoLeft;
1313
while (i >=1 ||j <nums.length -1) {
1414
// sub array [i...j] is already traversed. Either goLeft or goRight to increase the
1515
// sequence

‎src/main/java/g1901_2000/s1979_find_greatest_common_divisor_of_array/Solution.java

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -6,19 +6,19 @@ public class Solution {
66
publicintfindGCD(int[]nums) {
77
intmax =Integer.MIN_VALUE;
88
intmin =Integer.MAX_VALUE;
9-
for (inti =0;i <nums.length;i++) {
10-
if (max <nums[i]) {
11-
max =nums[i];
9+
for (intnum :nums) {
10+
if (max <num) {
11+
max =num;
1212
}
13-
if (min >nums[i]) {
14-
min =nums[i];
13+
if (min >num) {
14+
min =num;
1515
}
1616
}
1717
returnfindGCD(max,min);
1818
}
1919

2020
privateintfindGCD(intx,inty) {
21-
intr =0;
21+
intr;
2222
inta;
2323
intb;
2424
a = (x >y) ?x :y;

‎src/main/java/g2001_2100/s2074_reverse_nodes_in_even_length_groups/Solution.java

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

4141
privateListNode[]reverse(ListNodehead,intsize) {
4242
ListNodeprev =null;
43-
ListNodeforward =null;
43+
ListNodeforward;
4444
ListNodecur =head;
4545
while (size-- >0) {
4646
forward =cur.next;

‎src/main/java/g2001_2100/s2091_removing_minimum_and_maximum_from_array/Solution.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -19,9 +19,9 @@ public int minimumDeletions(int[] nums) {
1919
maxIndex =i;
2020
}
2121
}
22-
intfirstCase =0;
23-
intsecondCase =0;
24-
intthirdCase =0;
22+
intfirstCase;
23+
intsecondCase;
24+
intthirdCase;
2525
if (minIndex >maxIndex) {
2626
firstCase =minIndex +1;
2727
secondCase =n -maxIndex;

‎src/main/java/g2101_2200/s2165_smallest_value_of_the_rearranged_number/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
publicclassSolution {
66
publiclongsmallestNumber(longnum) {
77
int[]count =newint[10];
8-
longtempNum =0;
8+
longtempNum;
99
if (num >0) {
1010
tempNum =num;
1111
}else {

‎src/main/java/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -46,7 +46,7 @@ private boolean dfs(int u, int v, int open, int close, Boolean[][][] dp) {
4646
if (v ==n -1) {
4747
returndfs(u +1,v,open,close,dp);
4848
}
49-
booleanrslt =false;
49+
booleanrslt;
5050
if (grid[u][v] ==LFTPAR) {
5151
rslt =dfs(u +1,v,open,close,dp) ||dfs(u,v +1,open,close,dp);
5252
}else {

‎src/main/java/g2201_2300/s2276_count_integers_in_intervals/CountIntervals.java

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

88
publicclassCountIntervals {
99
privatefinalTreeMap<Integer,Integer>map;
10-
privateintcount =0;
10+
privateintcount;
1111

1212
publicCountIntervals() {
1313
map =newTreeMap<>();

‎src/main/java/g2301_2400/s2309_greatest_english_letter_in_upper_and_lower_case/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ public String greatestLetter(String s) {
88
boolean[]sA =newboolean[26];
99
boolean[]uA =newboolean[26];
1010
for (charch :s.toCharArray()) {
11-
inti =0;
11+
inti;
1212
if (ch <='Z' &&ch >='A') {
1313
i =ch -'A';
1414
uA[i] =true;

‎src/test/java/g0701_0800/s0784_letter_case_permutation/SolutionTest.java

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -19,4 +19,9 @@ void letterCasePermutation2() {
1919
assertThat(
2020
newSolution().letterCasePermutation("3z4"),equalTo(Arrays.asList("3z4","3Z4")));
2121
}
22+
23+
@Test
24+
voidletterCasePermutation3() {
25+
assertThat(newSolution().letterCasePermutation("C"),equalTo(Arrays.asList("C","c")));
26+
}
2227
}

0 commit comments

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