|
| 1 | +package p25xx |
| 2 | + |
| 3 | +import util.expect |
| 4 | + |
| 5 | +fun main() { |
| 6 | + class Solution { |
| 7 | + fun mergeArrays(nums1: Array<IntArray>, nums2: Array<IntArray>): Array<IntArray> { |
| 8 | + var leftIndex = 0 |
| 9 | + var rightIndex = 0 |
| 10 | + |
| 11 | + val result = arrayListOf<IntArray>() |
| 12 | + |
| 13 | + while (leftIndex < nums1.size || rightIndex < nums2.size) { |
| 14 | + when { |
| 15 | + leftIndex == nums1.size || rightIndex < nums2.size && nums1[leftIndex][0] > nums2[rightIndex][0] -> { |
| 16 | + result.add(nums2[rightIndex++]) |
| 17 | + } |
| 18 | + |
| 19 | + rightIndex == nums2.size || nums1[leftIndex][0] < nums2[rightIndex][0] -> { |
| 20 | + result.add(nums1[leftIndex++]) |
| 21 | + } |
| 22 | + |
| 23 | + else -> { |
| 24 | + result += intArrayOf(nums1[leftIndex][0], nums1[leftIndex++][1] + nums2[rightIndex++][1]) |
| 25 | + } |
| 26 | + } |
| 27 | + } |
| 28 | + |
| 29 | + return result.toTypedArray() |
| 30 | + } |
| 31 | + } |
| 32 | + |
| 33 | + expect { |
| 34 | + Solution().mergeArrays( |
| 35 | + arrayOf( |
| 36 | + intArrayOf(2, 4), |
| 37 | + intArrayOf(3, 6), |
| 38 | + intArrayOf(5, 5), |
| 39 | + ), arrayOf( |
| 40 | + intArrayOf(1, 5), |
| 41 | + intArrayOf(4, 5), |
| 42 | + ) |
| 43 | + ) |
| 44 | + } |
| 45 | +} |
0 commit comments