Skip to content

Commit e469390

Browse files
committed
Fixed idea warnings
1 parent d47efe8 commit e469390

File tree

30 files changed

+109
-138
lines changed

30 files changed

+109
-138
lines changed

src/main/java/g0001_0100/s0068_text_justification/Solution.java

Lines changed: 7 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -44,9 +44,13 @@ public List<String> fullJustify(String[] words, int maxWidth) {
4444
sb.append(' ');
4545
}
4646
// appending the rest of the required spaces
47-
for (int k = 0; k < (maxWidth - lineTotal) / (numWordsOnLine - 1); k++) {
48-
sb.append(' ');
49-
}
47+
sb.append(
48+
" "
49+
.repeat(
50+
Math.max(
51+
0,
52+
(maxWidth - lineTotal)
53+
/ (numWordsOnLine - 1))));
5054
}
5155
// appending the last word of the line
5256
sb.append(words[startWord + numWordsOnLine - 1]);

src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -36,11 +36,7 @@ public void serialize(TreeNode root, StringBuilder sb) {
3636
return;
3737
}
3838
String s = Integer.toHexString(root.val + BASE_OFFSET);
39-
StringBuilder sb2 = new StringBuilder();
40-
for (int i = 0; i < 3 - s.length(); i++) {
41-
sb2.append('0');
42-
}
43-
sb2.append(s);
39+
String sb2 = "0".repeat(Math.max(0, 3 - s.length())) + s;
4440
sb.append(sb2);
4541
serialize(root.left, sb);
4642
serialize(root.right, sb);

src/main/java/g0401_0500/s0451_sort_characters_by_frequency/Solution.java

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -27,9 +27,7 @@ public String frequencySort(String s) {
2727
for (Map.Entry<Integer, List<Character>> freq : reverseMap.entrySet()) {
2828
List<Character> list = reverseMap.get(freq.getKey());
2929
for (char c : list) {
30-
for (int i = 0; i < freq.getKey(); i++) {
31-
sb.append(c);
32-
}
30+
sb.append(String.valueOf(c).repeat(Math.max(0, freq.getKey())));
3331
}
3432
}
3533
return sb.toString();

src/main/java/g0401_0500/s0494_target_sum/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -7,8 +7,8 @@ public class Solution {
77
public int findTargetSumWays(int[] nums, int target) {
88
int totalSum = 0;
99
int n = nums.length;
10-
for (int i = 0; i < n; i++) {
11-
totalSum += nums[i];
10+
for (int num : nums) {
11+
totalSum += num;
1212
}
1313
int sum = totalSum - target;
1414
if (sum < 0 || sum % 2 == 1) {

src/main/java/g0701_0800/s0753_cracking_the_safe/Solution.java

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -12,9 +12,7 @@ public String crackSafe(int n, int k) {
1212
visited[0] = true;
1313
int visitedCnt = 1;
1414
StringBuilder crackStr = new StringBuilder();
15-
for (int i = 0; i < n; i++) {
16-
crackStr.append('0');
17-
}
15+
crackStr.append("0".repeat(Math.max(0, n)));
1816
dfsAddPwd(n, k, crackStr, 0, visited, visitedCnt, targetCnt);
1917
return foundStr;
2018
}

src/main/java/g0901_1000/s0972_equal_rational_numbers/Solution.java

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -29,10 +29,6 @@ public boolean isRationalEqual(String s, String t) {
2929
}
3030

3131
private String repeat(String a) {
32-
StringBuilder sb = new StringBuilder();
33-
for (int i = 0; i < 100; i++) {
34-
sb.append(a);
35-
}
36-
return sb.toString();
32+
return String.valueOf(a).repeat(100);
3733
}
3834
}

src/main/java/g1101_1200/s1138_alphabet_board_path/Solution.java

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -35,9 +35,7 @@ public String alphabetBoardPath(String target) {
3535

3636
public StringBuilder helper(String dir, int time) {
3737
StringBuilder path = new StringBuilder();
38-
for (int i = 0; i < time; i++) {
39-
path.append(dir);
40-
}
38+
path.append(String.valueOf(dir).repeat(Math.max(0, time)));
4139
return path;
4240
}
4341
}

src/main/java/g1501_1600/s1592_rearrange_spaces_between_words/Solution.java

Lines changed: 3 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -12,25 +12,17 @@ public String reorderSpaces(String text) {
1212
}
1313
String[] words = text.trim().split("\\s+");
1414
if (words.length == 1) {
15-
StringBuilder sb = new StringBuilder(words[0]);
16-
for (int i = 0; i < spaceCount; i++) {
17-
sb.append(" ");
18-
}
19-
return sb.toString();
15+
return words[0] + " ".repeat(Math.max(0, spaceCount));
2016
}
2117
int trailingSpaces = spaceCount % (words.length - 1);
2218
int newSpaces = spaceCount / (words.length - 1);
2319
StringBuilder sb = new StringBuilder();
2420
for (int j = 0; j < words.length; j++) {
2521
sb.append(words[j]);
2622
if (j < words.length - 1) {
27-
for (int i = 0; i < newSpaces; i++) {
28-
sb.append(" ");
29-
}
23+
sb.append(" ".repeat(Math.max(0, newSpaces)));
3024
} else {
31-
for (int i = 0; i < trailingSpaces; i++) {
32-
sb.append(" ");
33-
}
25+
sb.append(" ".repeat(Math.max(0, trailingSpaces)));
3426
}
3527
}
3628
return sb.toString();

src/main/java/g1601_1700/s1643_kth_smallest_instructions/Solution.java

Lines changed: 2 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -19,14 +19,10 @@ public String kthSmallestPath(int[] destination, int k) {
1919
k -= range;
2020
}
2121
if (v == 0) {
22-
for (int i = 1; i <= n; i++) {
23-
sb.append('H');
24-
}
22+
sb.append("H".repeat(Math.max(0, n)));
2523
break;
2624
} else if (v == n) {
27-
for (int i = 1; i <= v; i++) {
28-
sb.append('V');
29-
}
25+
sb.append("V".repeat(Math.max(0, v)));
3026
break;
3127
}
3228
}

src/main/java/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/Solution.java

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -7,17 +7,17 @@
77
public class Solution {
88
public boolean canChoose(int[][] groups, int[] nums) {
99
int prev = 0;
10-
for (int i = 0; i < groups.length; i++) {
11-
int[] temp = new int[groups[i].length];
12-
if (prev + groups[i].length > nums.length) {
10+
for (int[] group : groups) {
11+
int[] temp = new int[group.length];
12+
if (prev + group.length > nums.length) {
1313
return false;
1414
}
1515
int index = 0;
1616
int j;
17-
for (j = prev; j < prev + groups[i].length; j++) {
17+
for (j = prev; j < prev + group.length; j++) {
1818
temp[index++] = nums[j];
1919
}
20-
if (Arrays.equals(temp, groups[i])) {
20+
if (Arrays.equals(temp, group)) {
2121
prev = j;
2222
continue;
2323
}
@@ -28,7 +28,7 @@ public boolean canChoose(int[][] groups, int[] nums) {
2828
temp[l] = temp[l + 1];
2929
}
3030
temp[l] = nums[k];
31-
if (Arrays.equals(temp, groups[i])) {
31+
if (Arrays.equals(temp, group)) {
3232
prev = k + 1;
3333
break;
3434
}

0 commit comments

Comments
 (0)