合并已排序的数组，两个指针
func merge(nums1 []int, m int, nums2 []int, n int) {
for m > 0 || n > 0 {
if n == 0 {
break
}
if m == 0 {
nums1[n-1] = nums2[n-1]
n--
continue
}
if nums1[m-1] > nums2[n-1] {
nums1[m+n-1] = nums1[m-1]
m--
} else {
nums1[m+n-1] = nums2[n-1]
n--
}
}
}
合并已排序的数组，两个指针
88. Merge Sorted Array Description Given two sorted integ...
88. Merge Sorted Array Given two sorted integer arrays nu...
88. Merge Sorted Array Given two sorted integer arrays nu...
88. Merge Sorted Array Given two sorted integer arrays nu...
88. Merge Sorted Array Given two sorted integer arrays nu...
Algorithm 88. Merge Sorted Array[https://leetcode.com/pro...
88. 合并两个有序数组[https://leetcode.cn/problems/merge-sorted-ar...
88. 合并两个有序数组[https://leetcode.cn/problems/merge-sorted-ar...
题型 1. 排序：两个或多个array（一般是sorted）按照某规则排序 88. Merge Sorted Ar...
本文标题：88. Merge Sorted Array.go
本文链接：https://www.haomeiwen.com/subject/fvjpvqtx.html
网友评论