Skip to content

Commit be570cb

Browse files
committed
Fixed sonar
1 parent cec1211 commit be570cb

File tree

3 files changed

+32
-33
lines changed

3 files changed

+32
-33
lines changed

src/main/java/g3301_3400/s3309_maximum_possible_number_by_binary_concatenation/Solution.java

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -23,9 +23,8 @@ public int maxGoodNumber(int[] nums) {
2323
private void solve(int[] nums, boolean[] visited, int pos, StringBuilder sb) {
2424
if (pos == nums.length) {
2525
String val = sb.toString();
26-
if (result.length() == val.length() && result.compareTo(val) < 0) {
27-
result = val;
28-
} else if (val.length() > result.length()) {
26+
if ((result.length() == val.length() && result.compareTo(val) < 0)
27+
|| val.length() > result.length()) {
2928
result = val;
3029
}
3130
return;

src/main/java/g3301_3400/s3310_remove_methods_from_project/Solution.java

Lines changed: 4 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -19,12 +19,10 @@ public List<Integer> remainingMethods(int n, int k, int[][] invocations) {
1919
dfs(k, true);
2020
Arrays.fill(visited, false);
2121
for (int i = 0; i < n; i++) {
22-
if (!suspicious[i]) {
23-
if (dfs2(i)) {
24-
Arrays.fill(visited, false);
25-
dfs(k, false);
26-
break;
27-
}
22+
if (!suspicious[i] && dfs2(i)) {
23+
Arrays.fill(visited, false);
24+
dfs(k, false);
25+
break;
2826
}
2927
}
3028
ArrayList<Integer> rst = new ArrayList<>();
@@ -64,17 +62,14 @@ public boolean dfs2(int u) {
6462
}
6563

6664
private void pack(int[][] edges, int n) {
67-
int m = edges.length;
6865
int[] adj = new int[n];
6966
for (int[] edge : edges) {
7067
adj[edge[0]]++;
7168
}
72-
7369
graph = new int[n][];
7470
for (int i = 0; i < n; i++) {
7571
graph[i] = new int[adj[i]];
7672
}
77-
7873
for (int[] edge : edges) {
7974
graph[edge[0]][--adj[edge[0]]] = edge[1];
8075
}

src/main/java/g3301_3400/s3311_construct_2d_grid_matching_graph_layout/Solution.java

Lines changed: 26 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -55,27 +55,7 @@ public int[][] constructGridLayout(int n, int[][] edges) {
5555
}
5656
}
5757
if (row2 >= 0) {
58-
res = new int[2][n / 2];
59-
res[0][0] = st;
60-
res[1][0] = row2;
61-
seen[st] = seen[row2] = true;
62-
for (int i = 1; i < res[0].length; ++i) {
63-
for (int a : als[res[0][i - 1]]) {
64-
if (!seen[a]) {
65-
res[0][i] = a;
66-
seen[a] = true;
67-
break;
68-
}
69-
}
70-
for (int a : als[res[1][i - 1]]) {
71-
if (!seen[a]) {
72-
res[1][i] = a;
73-
seen[a] = true;
74-
break;
75-
}
76-
}
77-
}
78-
return res;
58+
return getInts(n, st, row2, seen, als);
7959
}
8060
final ArrayList<Integer> al = new ArrayList<>();
8161
boolean f = true;
@@ -112,4 +92,29 @@ public int[][] constructGridLayout(int n, int[][] edges) {
11292
}
11393
return res;
11494
}
95+
96+
private int[][] getInts(int n, int st, int row2, boolean[] seen, ArrayList<Integer>[] als) {
97+
int[][] res;
98+
res = new int[2][n / 2];
99+
res[0][0] = st;
100+
res[1][0] = row2;
101+
seen[st] = seen[row2] = true;
102+
for (int i = 1; i < res[0].length; ++i) {
103+
for (int a : als[res[0][i - 1]]) {
104+
if (!seen[a]) {
105+
res[0][i] = a;
106+
seen[a] = true;
107+
break;
108+
}
109+
}
110+
for (int a : als[res[1][i - 1]]) {
111+
if (!seen[a]) {
112+
res[1][i] = a;
113+
seen[a] = true;
114+
break;
115+
}
116+
}
117+
}
118+
return res;
119+
}
115120
}

0 commit comments

Comments
 (0)