Replaced Arrays.stream() with object methods

Author: javadev

src/main/kotlin/g0501_0600/s0552_student_attendance_record_ii/Solution.kt

@@ -2,8 +2,6 @@ package g0501_0600.s0552_student_attendance_record_ii
 
 // #Hard #Dynamic_Programming #2023_01_17_Time_151_ms_(100.00%)_Space_33.3_MB_(100.00%)
 
-import java.util.Arrays
-
 @Suppress("NAME_SHADOWING")
 class Solution {
     fun checkRecord(n: Int): Int {
@@ -21,7 +19,7 @@ class Solution {
         )
         val e = quickPower(matrix, n - 1)
         return (
-            (Arrays.stream(e[0]).sum() + Arrays.stream(e[1]).sum() + Arrays.stream(e[3]).sum()) %
+            (e[0].sum() + e[1].sum() + e[3].sum()) %
                 mod
             ).toInt()
     }

src/main/kotlin/g0601_0700/s0679_24_game/Solution.kt

@@ -2,11 +2,10 @@ package g0601_0700.s0679_24_game
 
 // #Hard #Array #Math #Backtracking #2023_02_16_Time_175_ms_(100.00%)_Space_34.7_MB_(100.00%)
 
-import java.util.Arrays
 import kotlin.math.abs
 
 class Solution {
-    private fun backtrack(list: DoubleArray, n: Int): Boolean {
+    private fun backtrack(list: Array<Double>, n: Int): Boolean {
         if (n == 1) {
             return abs(list[0] - 24) < EPS
         }
@@ -51,7 +50,7 @@ class Solution {
     }
 
     fun judgePoint24(nums: IntArray): Boolean {
-        val a = Arrays.stream(nums).asDoubleStream().toArray()
+        val a = nums.map { it.toDouble() }.toTypedArray()
         return backtrack(a, a.size)
     }
 

src/main/kotlin/g0901_1000/s0954_array_of_doubled_pairs/Solution.kt

@@ -3,12 +3,10 @@ package g0901_1000.s0954_array_of_doubled_pairs
 // #Medium #Array #Hash_Table #Sorting #Greedy
 // #2023_05_02_Time_462_ms_(100.00%)_Space_92.1_MB_(50.00%)
 
-import java.util.Arrays
-
 class Solution {
     fun canReorderDoubled(arr: IntArray): Boolean {
-        val max = 0.coerceAtLeast(Arrays.stream(arr).max().asInt)
-        val min = 0.coerceAtMost(Arrays.stream(arr).min().asInt)
+        val max = 0.coerceAtLeast(arr.max())
+        val min = 0.coerceAtMost(arr.min())
         val positive = IntArray(max + 1)
         val negative = IntArray(-min + 1)
         for (a in arr) {

src/main/kotlin/g1001_1100/s1005_maximize_sum_of_array_after_k_negations/Solution.kt

@@ -2,8 +2,6 @@ package g1001_1100.s1005_maximize_sum_of_array_after_k_negations
 
 // #Easy #Array #Sorting #Greedy #2023_05_15_Time_167_ms_(100.00%)_Space_36.5_MB_(20.00%)
 
-import java.util.Arrays
-
 @Suppress("NAME_SHADOWING")
 class Solution {
     fun largestSumAfterKNegations(nums: IntArray, k: Int): Int {
@@ -24,6 +22,6 @@ class Solution {
         if (k and 1 == 1) {
             nums[minIndex] *= -1
         }
-        return Arrays.stream(nums).sum()
+        return nums.sum()
     }
 }