level 1
https://leetcode.com/problems/merge-sorted-array/submissions/1646916828/?source=submission-noac
fun merge(nums1: IntArray, m: Int, nums2: IntArray, n: Int) {
val result = IntArray(m + n)
if (m > 0) {
for (i in nums1.indices) {
if (i < m) {
result[i] = nums1[i]
}
}
}
if (n > 0) {
for (i in nums2.indices) {
if (i < n) {
result[m + i] = nums2[i]
}
}
}
result.sort()
var resultString = "["
for (i in result.indices) {
resultString += result[i]
if (i != result.size - 1) {
resultString += ","
}
}
resultString += "]"
println(resultString)
}
2025年05月28日 10点05分
1
fun merge(nums1: IntArray, m: Int, nums2: IntArray, n: Int) {
val result = IntArray(m + n)
if (m > 0) {
for (i in nums1.indices) {
if (i < m) {
result[i] = nums1[i]
}
}
}
if (n > 0) {
for (i in nums2.indices) {
if (i < n) {
result[m + i] = nums2[i]
}
}
}
result.sort()
var resultString = "["
for (i in result.indices) {
resultString += result[i]
if (i != result.size - 1) {
resultString += ","
}
}
resultString += "]"
println(resultString)
}