Fixed sonar

Author: javadev

src/main/kotlin/g3401_3500/s3407_substring_matching_pattern/Solution.kt

@@ -22,7 +22,7 @@ class Solution {
     private fun `fun`(s: String, k: String): Int {
         val n = s.length
         val m = k.length
-        var j = 0
+        var j: Int
         for (i in 0..n - m) {
             j = 0
             while (j < m) {

src/main/kotlin/g3401_3500/s3410_maximize_subarray_sum_after_removing_all_occurrences_of_one_element/Solution.kt

@@ -8,7 +8,7 @@ import kotlin.math.min
 
 class Solution {
     fun maxSubarraySum(nums: IntArray): Long {
-        val prefixMap: MutableMap<Long?, Long?> = HashMap<Long?, Long?>()
+        val prefixMap: MutableMap<Long, Long> = HashMap<Long, Long>()
         var result = nums[0].toLong()
         var prefixSum: Long = 0
         var minPrefix: Long = 0
@@ -28,7 +28,7 @@ class Solution {
                 minPrefix = min(minPrefix, prefixMap[num.toLong()]!!)
             }
             prefixMap.put(0L, min(prefixMap[0L]!!, prefixSum))
-            minPrefix = min(minPrefix.toDouble(), prefixMap.get(0L)!!.toDouble()).toLong()
+            minPrefix = min(minPrefix, prefixMap[0L]!!)
         }
         return result
     }

src/main/kotlin/g3401_3500/s3412_find_mirror_score_of_a_string/Solution.kt

@@ -5,18 +5,15 @@ package g3401_3500.s3412_find_mirror_score_of_a_string
 class Solution {
     fun calculateScore(s: String): Long {
         val n = s.length
-        val st: Array<ArrayList<Int?>?> = arrayOfNulls<ArrayList<Int?>>(26)
+        val st: Array<ArrayList<Int>> = Array<ArrayList<Int>>(26) { ArrayList<Int>() }
         var r: Long = 0
-        for (i in 0..25) {
-            st[i] = ArrayList<Int?>()
-        }
         for (i in 0..<n) {
             val mc = 'z'.code - (s[i].code - 'a'.code)
             val p = mc - 'a'.code
-            if (!st[p]!!.isEmpty()) {
-                r += (i - st[p]!!.removeAt(st[p]!!.size - 1)!!).toLong()
+            if (st[p].isNotEmpty()) {
+                r += (i - st[p].removeAt(st[p].size - 1)).toLong()
             } else {
-                st[s[i].code - 'a'.code]!!.add(i)
+                st[s[i].code - 'a'.code].add(i)
             }
         }
         return r