Improved 3533

Author: javadev

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

@@ -39,15 +39,15 @@ class Solution {
         digCnt: IntArray,
         nums: IntArray,
         pow10: IntArray,
-        visited: Array<BooleanArray?>,
+        visited: Array<BooleanArray>,
         ansIdx: Int,
         ans: IntArray,
         n: Int,
     ): Boolean {
         if (ansIdx == n) {
             return residue == 0
         }
-        if (visited[mask]!![residue]) {
+        if (visited[mask][residue]) {
             return false
         }
         var i = 0
@@ -66,7 +66,7 @@ class Solution {
             i++
             bit = bit shl 1
         }
-        visited[mask]!![residue] = true
+        visited[mask][residue] = true
         return false
     }
 }