Added tasks 960-1012

Author: javadev

README.md

@@ -68,7 +68,7 @@ class StockSpanner {
         if (stocks.size == 1) {
             return index - stocks.peek()
         }
-        while (stocks.size > 1 && map[stocks.peek()]!! <= price) {
+        while (stocks.size > 1 && map.getValue(stocks.peek()) <= price) {
             stocks.pop()
         }
         return index - stocks.peek()

src/main/kotlin/g0901_1000/s0901_online_stock_span/readme.md

@@ -73,7 +73,7 @@ class Solution {
         queue.add(1)
         visited[0] = true
         var step = 0
-        while (!queue.isEmpty()) {
+        while (queue.isNotEmpty()) {
             val queueSize = queue.size
             for (i in 0 until queueSize) {
                 val previousLabel = queue.poll()

src/main/kotlin/g0901_1000/s0909_snakes_and_ladders/readme.md

@@ -98,7 +98,7 @@ class Solution {
             q.offer(intArrayOf(0, i, CAT, MOUSE_WIN))
             q.offer(intArrayOf(i, i, CAT, CAT_WIN))
         }
-        while (!q.isEmpty()) {
+        while (q.isNotEmpty()) {
             val state = q.poll()
             val mouse = state[0]
             val cat = state[1]

src/main/kotlin/g0901_1000/s0913_cat_and_mouse/readme.md

@@ -43,13 +43,12 @@ class Solution {
         val map: HashMap<Int, Int> = HashMap()
         for (j in deck) {
             if (map.containsKey(j)) {
-                map[j] = map[j]!! + 1
+                map[j] = map.getValue(j) + 1
             } else {
                 map[j] = 1
             }
         }
-        var x = map[deck[0]]!!
-
+        var x = map.getValue(deck[0])
         for (entry in map.entries.iterator()) {
             x = gcd(x, entry.value)
         }

src/main/kotlin/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/readme.md

@@ -68,7 +68,7 @@ class CBTInserter(root: TreeNode?) {
     private fun addToQueue() {
         val hlq: Queue<TreeNode> = LinkedList()
         hlq.add(head)
-        while (!hlq.isEmpty()) {
+        while (hlq.isNotEmpty()) {
             var size = hlq.size
             while (size-- > 0) {
                 val poll: TreeNode = hlq.poll()
@@ -97,7 +97,7 @@ class CBTInserter(root: TreeNode?) {
     }
 
     private fun deleteFullNode() {
-        while (!q.isEmpty()) {
+        while (q.isNotEmpty()) {
             val peek: TreeNode = q.peek()
             if (peek.left != null && peek.right != null) {
                 q.poll()

src/main/kotlin/g0901_1000/s0919_complete_binary_tree_inserter/readme.md

@@ -45,7 +45,7 @@ class Solution {
         val stack: Deque<Char> = LinkedList()
         for (c in s.toCharArray()) {
             if (c == ')') {
-                if (!stack.isEmpty() && stack.peek() == '(') {
+                if (stack.isNotEmpty() && stack.peek() == '(') {
                     stack.pop()
                 } else {
                     stack.push(c)

src/main/kotlin/g0901_1000/s0921_minimum_add_to_make_parentheses_valid/readme.md

@@ -64,7 +64,7 @@ class Solution {
                 visited!!.add(initial[i])
             }
         }
-        while (!q.isEmpty()) {
+        while (q.isNotEmpty()) {
             val curr = q.poll()
             if (curr != initial[ind]) {
                 count++
@@ -87,7 +87,7 @@ class Solution {
             adj.putIfAbsent(i, ArrayList())
             for (j in 0 until n) {
                 if (graph[i][j] == 1) {
-                    adj[i]!!.add(j)
+                    adj.getValue(i).add(j)
                 }
             }
         }
@@ -96,7 +96,7 @@ class Solution {
         var node = initial[0]
         for (i in initial.indices) {
             visited = HashSet()
-            val children = adj[initial[i]]!!
+            val children = adj.getValue(initial[i])
             adj.remove(initial[i])
             bfs(i, initial)
             if (count < min) {

src/main/kotlin/g0901_1000/s0928_minimize_malware_spread_ii/readme.md

@@ -67,7 +67,7 @@ class Solution {
             i++
         }
         var level = -1
-        while (!q.isEmpty()) {
+        while (q.isNotEmpty()) {
             var size: Int = q.size
             level++
             while (size-- > 0) {

src/main/kotlin/g0901_1000/s0934_shortest_bridge/readme.md

@@ -46,7 +46,7 @@ class Solution {
         val map: MutableMap<Int, MutableSet<Int>> = HashMap()
         for (p in points) {
             map.putIfAbsent(p[0], HashSet())
-            map[p[0]]!!.add(p[1])
+            map.getValue(p[0]).add(p[1])
         }
         Arrays.sort(
             points
@@ -65,7 +65,7 @@ class Solution {
                 if (area >= min || area == 0) {
                     continue
                 }
-                if (map[p1[0]]!!.contains(p2[1]) && map[p2[0]]!!.contains(p1[1])) {
+                if (map.getValue(p1[0]).contains(p2[1]) && map.getValue(p2[0]).contains(p1[1])) {
                     min = area
                 }
             }