jscrdev/LeetCode-in-JavaPublic

NotificationsYou must be signed in to change notification settings
Fork0
Star0

Commit44c81f5

authored

Fixed Idea warnings

1 parent0137c61 commit44c81f5Copy full SHA for 44c81f5

File tree

17 files changed

+25

-25

lines changed

src/main/java
- g0001_0100/s0045_jump_game_ii
  - Solution.java
- g0701_0800/s0706_design_hashmap
  - MyHashMap.java
- g1801_1900/s1837_sum_of_digits_in_base_k
  - Solution.java
- g2301_2400
  - s2332_the_latest_time_to_catch_a_bus
    - Solution.java
  - s2380_time_needed_to_rearrange_a_binary_string
    - Solution.java
  - s2384_largest_palindromic_number
    - Solution.java
- g2401_2500
  - s2410_maximum_matching_of_players_with_trainers
    - Solution.java
  - s2468_split_message_based_on_limit
    - Solution.java
- g2701_2800/s2745_construct_the_longest_new_string
  - Solution.java
- g2801_2900
  - s2812_find_the_safest_path_in_a_grid
    - Solution.java
  - s2816_double_a_number_represented_as_a_linked_list
    - Solution.java
- g2901_3000
  - s2932_maximum_strong_pair_xor_i
    - Solution.java
  - s2972_count_the_number_of_incremovable_subarrays_ii
    - Solution.java
- g3101_3200/s3108_minimum_cost_walk_in_weighted_graph
  - Solution.java
- g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i
  - Solution.java
- g3401_3500
  - s3407_substring_matching_pattern
    - Solution.java
  - s3424_minimum_cost_to_make_arrays_identical
    - Solution.java

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 number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@`
`8`	`8`	`publicclassSolution {`
`9`	`9`	`privateintgetMax(int[]nums,intl,intr) {`
`10`	`10`	`intmax = -1;`
`11`		`-intcurr = -1;`
	`11`	`+intcurr;`
`12`	`12`	`for (inti =l;i <=r;i++) {`
`13`	`13`	`curr =i +nums[i];`
`14`	`14`	`max =Math.max(max,curr);`

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

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@`
`7`	`7`
`8`	`8`	`@SuppressWarnings("unchecked")`
`9`	`9`	`publicclassMyHashMap {`
`10`		`-privateArrayList[]arr =null;`
	`10`	`+privatefinalArrayList[]arr;`
`11`	`11`
`12`	`12`	`publicMyHashMap() {`
`13`	`13`	`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 number	Diff line number	Diff line change
`@@ -4,9 +4,9 @@`
`4`	`4`
`5`	`5`	`publicclassSolution {`
`6`	`6`	`publicintsumBase(intn,intk) {`
`7`		`-inta =0;`
	`7`	`+inta;`
`8`	`8`	`intsum =0;`
`9`		`-intb =0;`
	`9`	`+intb;`
`10`	`10`	`while (n !=0) {`
`11`	`11`	`a =n %k;`
`12`	`12`	`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 number	Diff line number	Diff line change
`@@ -32,7 +32,7 @@ public int latestTimeCatchTheBus(int[] buses, int[] passengers, int capacity) {`
`32`	`32`	`b++;`
`33`	`33`	`}`
`34`	`34`	`}`
`35`		`-intstart =0;`
	`35`	`+intstart;`
`36`	`36`	`if (c ==capacity) {`
`37`	`37`	`// capcity is full in last bus, find time last passenger might have boarded`
`38`	`38`	`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 number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@ public class Solution {`
`7`	`7`	`publicintsecondsToRemoveOccurrences(Strings) {`
`8`	`8`	`intlastOne = -1;`
`9`	`9`	`intresult =0;`
`10`		`-intprevResult =0;`
	`10`	`+intprevResult;`
`11`	`11`	`intcurResult =0;`
`12`	`12`	`intcountOne =0;`
`13`	`13`	`intcountZero =0;`

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

Lines changed: 5 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,25 +11,25 @@ public String largestPalindromic(String num) {`
`11`	`11`	`for (charc :num.toCharArray()) {`
`12`	`12`	`count[c -'0']++;`
`13`	`13`	`}`
`14`		`-intc =0;`
	`14`	`+intc;`
`15`	`15`	`for (inti =9;i >=0;i--) {`
`16`	`16`	`c =0;`
`17`	`17`	`if (count[i] %2 ==1 &&center == -1) {`
`18`	`18`	`center =i;`
`19`	`19`	`}`
`20`		`-if (first.length() ==0 &&i ==0) {`
	`20`	`+if (first.isEmpty() &&i ==0) {`
`21`	`21`	`continue;`
`22`	`22`	`}`
`23`	`23`	`while (c <count[i] /2) {`
`24`		`-first.append(String.valueOf(i));`
	`24`	`+first.append(i);`
`25`	`25`	`c++;`
`26`	`26`	`}`
`27`	`27`	`}`
`28`	`28`	`second =newStringBuilder(first.toString());`
`29`	`29`	`if (center != -1) {`
`30`	`30`	`first.append(center);`
`31`	`31`	`}`
`32`		`-first.append(second.reverse().toString());`
`33`		`-returnfirst.length() ==0 ?"0" :first.toString();`
	`32`	`+first.append(second.reverse());`
	`33`	`+returnfirst.isEmpty() ?"0" :first.toString();`
`34`	`34`	`}`
`35`	`35`	`}`

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

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -10,7 +10,7 @@ public class Solution {`
`10`	`10`	`publicintmatchPlayersAndTrainers(int[]players,int[]trainers) {`
`11`	`11`	`Arrays.sort(players);`
`12`	`12`	`Arrays.sort(trainers);`
`13`		`-inti =0;`
	`13`	`+inti;`
`14`	`14`	`intj =0;`
`15`	`15`	`intcount =0;`
`16`	`16`	`i =0;`

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

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,7 @@`
`5`	`5`	`@SuppressWarnings("java:S3518")`
`6`	`6`	`publicclassSolution {`
`7`	`7`	`publicString[]splitMessage(Stringmessage,intlimit) {`
`8`		`-inttotal =0;`
	`8`	`+inttotal;`
`9`	`9`	`intrunning =0;`
`10`	`10`	`intcount;`
`11`	`11`	`inttotalReq;`

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

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,7 @@`
`5`	`5`	`publicclassSolution {`
`6`	`6`	`publicintlongestString(intx,inty,intz) {`
`7`	`7`	`intmin =Math.min(x,y);`
`8`		`-intres =0;`
	`8`	`+intres;`
`9`	`9`	`if (x ==y) {`
`10`	`10`	`res =2 *min +z;`
`11`	`11`	`}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 number	Diff line number	Diff line change
`@@ -22,7 +22,7 @@ public int maximumSafenessFactor(List<List<Integer>> grid) {`
`22`	`22`	`int[]tmpDeque;`
`23`	`23`	`int[]queue =newint[yLen *xLen];`
`24`	`24`	`int[]root =newint[yLen *xLen];`
`25`		`-inthead = -1;`
	`25`	`+inthead;`
`26`	`26`	`inttail = -1;`
`27`	`27`	`intqIdx = -1;`
`28`	`28`	`intend =yLen *xLen -1;`

0 commit comments

Comments

(0)

Movatterモバイル変換

Navigation Menu

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

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit44c81f5

File tree

17 files changed

17 files changed

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

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

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

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

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

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

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

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

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

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

0 commit comments