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

Commit 810facb

Browse files
authored
Resolved SonarQube warnings
1 parent 6c86c47 commit 810facb

File tree

5 files changed

+5
-5
lines changed

5 files changed

+5
-5
lines changed

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -33,6 +33,6 @@ public String simplifyPath(String path) {
3333
ans.insert(0, stk.pop());
3434
ans.insert(0, "/");
3535
}
36-
return ans.length() > 0 ? ans.toString() : "/";
36+
return !ans.isEmpty() ? ans.toString() : "/";
3737
}
3838
}

‎src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,7 @@ public String reverseWords(String s) {
1717
sb.append(s, start + 1, i + 1);
1818
i = start - 1;
1919
}
20-
if (sb.length() > 0) {
20+
if (!sb.isEmpty()) {
2121
sb.deleteCharAt(0);
2222
}
2323
return sb.toString();

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -44,7 +44,7 @@ public List<String> removeComments(String[] source) {
4444
}
4545
index++;
4646
}
47-
if (sb.length() > 0 && !multiComment) {
47+
if (!sb.isEmpty() && !multiComment) {
4848
result.add(sb.toString());
4949
sb.setLength(0);
5050
}

‎src/main/java/g1201_1300/s1209_remove_all_adjacent_duplicates_in_string_ii/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ public String removeDuplicates(String s, int k) {
77
StringBuilder sb = new StringBuilder();
88
int dupCount = 0;
99
for (int i = 0; i < s.length(); i++) {
10-
if (sb.length() != 0 && sb.charAt(sb.length() - 1) == s.charAt(i)) {
10+
if (!sb.isEmpty() && sb.charAt(sb.length() - 1) == s.charAt(i)) {
1111
dupCount++;
1212
} else {
1313
dupCount = 1;

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ public String smallestSubsequence(String s, int k, char letter, int repetition)
1212
StringBuilder sb = new StringBuilder();
1313
for (int i = 0; i < s.length(); count -= s.charAt(i++) == letter ? 1 : 0) {
1414
while (sb.length() + s.length() > i + k
15-
&& sb.length() > 0
15+
&& !sb.isEmpty()
1616
&& s.charAt(i) < sb.charAt(sb.length() - 1)
1717
&& (sb.charAt(sb.length() - 1) != letter || count != repetition)) {
1818
repetition += sb.charAt(sb.length() - 1) == letter ? 1 : 0;

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /