Improved tasks 870, 910

Author: javadev

src.save/main/kotlin/g0801_0900/s0870_advantage_shuffle/Solution.kt

@@ -2,13 +2,12 @@ package g0801_0900.s0870_advantage_shuffle
 
 // #Medium #Array #Sorting #Greedy #2023_04_05_Time_698_ms_(100.00%)_Space_51.1_MB_(100.00%)
 
-import java.util.Arrays
 import java.util.PriorityQueue
 
 class Solution {
     fun advantageCount(nums1: IntArray, nums2: IntArray): IntArray {
         val n = nums1.size
-        Arrays.sort(nums1)
+        nums1.sort()
         val maxpq = PriorityQueue { pair1: IntArray, pair2: IntArray ->
             pair2[1] - pair1[1]
         }

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

@@ -3,11 +3,9 @@ package g0901_1000.s0910_smallest_range_ii
 // #Medium #Array #Math #Sorting #Greedy #Programming_Skills_II_Day_13
 // #2023_04_15_Time_234_ms_(100.00%)_Space_37.1_MB_(100.00%)
 
-import java.util.Arrays
-
 class Solution {
     fun smallestRangeII(nums: IntArray, k: Int): Int {
-        Arrays.sort(nums)
+        nums.sort()
         val n = nums.size
         var ans = nums[n - 1] - nums[0]
         val min = nums[0] + k