Fixed sonar warnings

Author: javadev

src/main/java/g3501_3600/s3597_partition_string/Solution.java

@@ -7,24 +7,26 @@
 
 public class Solution {
     private static class Trie {
-        public Trie[] trie = new Trie[26];
+        Trie[] tries = new Trie[26];
     }
 
     public List<String> partitionString(String s) {
-        var trie = new Trie();
-        var res = new ArrayList<String>();
-        var node = trie;
-        for (int i = 0, j = 0; i < s.length() && j < s.length(); ) {
+        Trie trie = new Trie();
+        List<String> res = new ArrayList<>();
+        Trie node = trie;
+        int i = 0;
+        int j = 0;
+        while (i < s.length() && j < s.length()) {
             int idx = s.charAt(j) - 'a';
-            if (node.trie[idx] == null) {
+            if (node.tries[idx] == null) {
                 res.add(s.substring(i, j + 1));
-                node.trie[idx] = new Trie();
+                node.tries[idx] = new Trie();
                 i = j + 1;
                 j = i;
                 node = trie;
                 continue;
             } else {
-                node = node.trie[idx];
+                node = node.tries[idx];
                 j++;
             }
         }

src/main/java/g3501_3600/s3600_maximize_spanning_tree_stability_with_upgrades/Solution.java

@@ -38,10 +38,8 @@ private boolean feasible(int t, int n, int[][] edges, int k) {
             int v = edge[1];
             int s = edge[2];
             int m = edge[3];
-            if (m == 1) {
-                if (s < t || !uf.union(u, v)) {
-                    return false;
-                }
+            if (m == 1 && (s < t || !uf.union(u, v))) {
+                return false;
             }
         }
         for (int[] edge : edges) {
@@ -61,12 +59,10 @@ private boolean feasible(int t, int n, int[][] edges, int k) {
             int v = edge[1];
             int s = edge[2];
             int m = edge[3];
-            if (m == 0 && s >= half && s < t) {
-                if (uf.union(u, v)) {
-                    cost++;
-                    if (cost > k) {
-                        return false;
-                    }
+            if (m == 0 && s >= half && s < t && uf.union(u, v)) {
+                cost++;
+                if (cost > k) {
+                    return false;
                 }
             }
         }