Improved arrays

Author: javadev

src.save/main/kotlin/g0401_0500/s0493_reverse_pairs/Solution.kt

@@ -3,8 +3,6 @@ package g0401_0500.s0493_reverse_pairs
 // #Hard #Array #Binary_Search #Ordered_Set #Divide_and_Conquer #Segment_Tree #Binary_Indexed_Tree
 // #Merge_Sort #2023_01_04_Time_887_ms_(66.67%)_Space_73.9_MB_(66.67%)
 
-import java.util.Arrays
-
 class Solution {
     fun reversePairs(nums: IntArray): Int {
         return mergeSort(nums, 0, nums.size - 1)
@@ -25,7 +23,7 @@ class Solution {
             }
             cnt += j - (mid + 1)
         }
-        Arrays.sort(nums, start, end + 1)
+        nums.sort(start, end + 1)
         return cnt
     }
 }

src.save/test/kotlin/g0001_0100/s0026_remove_duplicates_from_sorted_array/SolutionTest.kt

@@ -3,20 +3,19 @@ package g0001_0100.s0026_remove_duplicates_from_sorted_array
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
-import java.util.Arrays
 
 internal class SolutionTest {
     @Test
     fun removeDuplicates() {
         val array = intArrayOf(1, 1, 2)
         val end = Solution().removeDuplicates(array)
-        assertThat(Arrays.toString(array.copyOfRange(0, end)), equalTo("[1, 2]"))
+        assertThat(array.copyOfRange(0, end), equalTo(intArrayOf(1, 2)))
     }
 
     @Test
     fun removeDuplicates2() {
         val array = intArrayOf(0, 0, 1, 1, 1, 2, 2, 3, 3, 4)
         val end = Solution().removeDuplicates(array)
-        assertThat(Arrays.toString(array.copyOfRange(0, end)), equalTo("[0, 1, 2, 3, 4]"))
+        assertThat(array.copyOfRange(0, end), equalTo(intArrayOf(0, 1, 2, 3, 4)))
     }
 }

src.save/test/kotlin/g0001_0100/s0027_remove_element/SolutionTest.kt

@@ -3,20 +3,19 @@ package g0001_0100.s0027_remove_element
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
-import java.util.Arrays
 
 internal class SolutionTest {
     @Test
     fun removeElement() {
         val original = intArrayOf(3, 2, 2, 3)
         val end = Solution().removeElement(original, 3)
-        assertThat(Arrays.copyOfRange(original, 0, end), equalTo(intArrayOf(2, 2)))
+        assertThat(original.copyOfRange(0, end), equalTo(intArrayOf(2, 2)))
     }
 
     @Test
     fun removeElement2() {
         val original = intArrayOf(0, 1, 2, 2, 3, 0, 4, 2)
         val end = Solution().removeElement(original, 2)
-        assertThat(Arrays.copyOfRange(original, 0, end), equalTo(intArrayOf(0, 1, 4, 0, 3)))
+        assertThat(original.copyOfRange(0, end), equalTo(intArrayOf(0, 1, 4, 0, 3)))
     }
 }

src.save/test/kotlin/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/SolutionTest.kt

@@ -3,20 +3,19 @@ package g0001_0100.s0080_remove_duplicates_from_sorted_array_ii
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
-import java.util.Arrays
 
 internal class SolutionTest {
     @Test
     fun removeDuplicates() {
         val array = intArrayOf(1, 1, 1, 2, 2, 3)
         val end = Solution().removeDuplicates(array)
-        assertThat(Arrays.copyOfRange(array, 0, end), equalTo(intArrayOf(1, 1, 2, 2, 3)))
+        assertThat(array.copyOfRange(0, end), equalTo(intArrayOf(1, 1, 2, 2, 3)))
     }
 
     @Test
     fun removeDuplicates2() {
         val array = intArrayOf(0, 0, 1, 1, 1, 1, 2, 3, 3)
         val end = Solution().removeDuplicates(array)
-        assertThat(Arrays.copyOfRange(array, 0, end), equalTo(intArrayOf(0, 0, 1, 1, 2, 3, 3)))
+        assertThat(array.copyOfRange(0, end), equalTo(intArrayOf(0, 0, 1, 1, 2, 3, 3)))
     }
 }

src/main/kotlin/g0701_0800/s0787_cheapest_flights_within_k_stops/Solution.kt

@@ -3,15 +3,13 @@ package g0701_0800.s0787_cheapest_flights_within_k_stops
 // #Medium #Dynamic_Programming #Depth_First_Search #Breadth_First_Search #Heap_Priority_Queue
 // #Graph #Shortest_Path #2023_03_13_Time_185_ms_(99.20%)_Space_36.6_MB_(89.64%)
 
-import java.util.Arrays
-
 class Solution {
     fun findCheapestPrice(n: Int, flights: Array<IntArray>, src: Int, dst: Int, k: Int): Int {
         // k + 2 becase there are total of k(intermediate stops) + 1(src) + 1(dst)
         // dp[i][j] = cost to reach j using atmost i edges from src
         val dp = Array(k + 2) { IntArray(n) }
         for (row in dp) {
-            Arrays.fill(row, Int.MAX_VALUE)
+            row.fill(Int.MAX_VALUE)
         }
         // cost to reach src is always 0
         for (i in 0..k + 1) {