Fixed sonar

Author: javadev

src/main/kotlin/g3501_3600/s3542_minimum_operations_to_convert_all_elements_to_zero/Solution.kt

@@ -11,7 +11,7 @@ class Solution {
         stack.push(0)
         var res = 0
         for (a in nums) {
-            while (!stack.isEmpty() && stack.peek()!! > a) {
+            while (stack.isNotEmpty() && stack.peek()!! > a) {
                 stack.pop()
             }
             if (stack.isEmpty() || stack.peek()!! < a) {

src/main/kotlin/g3501_3600/s3543_maximum_weighted_k_edge_path/Solution.kt

@@ -24,7 +24,7 @@ class Solution {
             adj.add(ArrayList<Pair>())
         }
         for (edge in edges) {
-            adj.get(edge[0]).add(Pair(edge[1], edge[2]))
+            adj[edge[0]].add(Pair(edge[1], edge[2]))
         }
         var ans = -1
         for (start in 0..<n) {
@@ -46,7 +46,7 @@ class Solution {
             return memo
         }
         var best = -1
-        for (p in adj.get(u)) {
+        for (p in adj[u]) {
             val res = dfs(adj, p.node, stepsRemaining - 1, t, currentSum + p.wt)
             best = max(best, res)
         }

src/main/kotlin/g3501_3600/s3544_subtree_inversion_sum/Solution.kt

@@ -70,8 +70,8 @@ class Solution {
             nei.add(ArrayList<Int>())
         }
         for (e in edges) {
-            nei.get(e[0]).add(e[1])
-            nei.get(e[1]).add(e[0])
+            nei[e[0]].add(e[1])
+            nei[e[1]].add(e[0])
         }
         getTotalSum(-1, 0)
         val res = getMaxInc(-1, 0)

src/main/kotlin/g3501_3600/s3545_minimum_deletions_for_at_most_k_distinct_characters/Solution.kt

@@ -8,7 +8,7 @@ class Solution {
         var count = 0
         val carr = IntArray(26)
         for (i in 0..<n) {
-            val ch = s.get(i)
+            val ch = s[i]
             carr[ch.code - 'a'.code]++
         }
         var dischar = 0