Improved tasks 2801-2824

Author: javadev

src/main/kotlin/g2801_2900/s2808_minimum_seconds_to_equalize_a_circular_array/Solution.kt

@@ -12,7 +12,7 @@ class Solution {
         val hm = HashMap<Int, MutableList<Int>>()
         for (i in 0 until n) {
             val v = nums[i]
-            hm.computeIfAbsent(v) { k: Int? -> ArrayList() }.add(i)
+            hm.computeIfAbsent(v) { _: Int? -> ArrayList() }.add(i)
         }
         for (list in hm.values) {
             if (list.size > 1) {

src/main/kotlin/g2801_2900/s2811_check_if_it_is_possible_to_split_array/Solution.kt

@@ -5,7 +5,7 @@ package g2801_2900.s2811_check_if_it_is_possible_to_split_array
 
 class Solution {
     fun canSplitArray(nums: List<Int>, m: Int): Boolean {
-        if (nums.size < 3 && !nums.isEmpty()) {
+        if (nums.size < 3 && nums.isNotEmpty()) {
             return true
         }
         var ans = false

src/main/kotlin/g2801_2900/s2812_find_the_safest_path_in_a_grid/Solution.kt

@@ -66,7 +66,7 @@ class Solution {
         }
         var level = 1
         val dir = arrayOf(intArrayOf(1, 0), intArrayOf(0, 1), intArrayOf(-1, 0), intArrayOf(0, -1))
-        while (!q.isEmpty()) {
+        while (q.isNotEmpty()) {
             val len = q.size
             for (i in 0 until len) {
                 val v = q.poll()

src/main/kotlin/g2801_2900/s2815_max_pair_sum_in_an_array/Solution.kt

@@ -3,7 +3,6 @@ package g2801_2900.s2815_max_pair_sum_in_an_array
 // #Easy #Array #Hash_Table #2023_12_06_Time_223_ms_(82.35%)_Space_37.6_MB_(100.00%)
 
 import java.util.PriorityQueue
-import kotlin.Comparator
 import kotlin.collections.HashMap
 import kotlin.math.max
 

src/main/kotlin/g2801_2900/s2816_double_a_number_represented_as_a_linked_list/Solution.kt

@@ -39,7 +39,7 @@ class Solution {
 
     private fun revList(head: ListNode?): ListNode? {
         var prev: ListNode? = null
-        var nxt: ListNode? = null
+        var nxt: ListNode?
         var current = head
         while (current != null) {
             nxt = current.next

src/main/kotlin/g2801_2900/s2817_minimum_absolute_difference_between_elements_with_constraint/Solution.kt

@@ -9,7 +9,6 @@ import kotlin.math.min
 
 class Solution {
     fun minAbsoluteDifference(nums: List<Int>, x: Int): Int {
-        // if (x == 0) x = 1;
         val xt = TreeSet<Int>()
         val start = nums.size - 1 - x
         var j = nums.size - 1

src/main/kotlin/g2801_2900/s2818_apply_operations_to_maximize_score/Solution.kt

@@ -29,7 +29,7 @@ class Solution {
             }
             // when an element is poped, its right bound is confirmed: (i - left + 1) * (right - i +
             // 1)
-            while (!monoStack.isEmpty() && monoStack.peekFirst()[0] < score) {
+            while (monoStack.isNotEmpty() && monoStack.peekFirst()[0] < score) {
                 val popIndex = monoStack.pollFirst()[1]
                 val actualRightIndexOfPopedElement = i - 1
                 dp[popIndex] *= actualRightIndexOfPopedElement - popIndex + 1