How to merge two ordered arrays by Java
This article introduces the knowledge about "how Java merges two ordered arrays". In the actual case operation process, many people will encounter such difficulties. Next, let Xiaobian lead you to learn how to deal with these situations! I hope you can read carefully and learn something!
topic
Given two ordered integer arrays nums1 and nums2, merge nums2 into nums1 so that num1 becomes an ordered array.
Description:
Initialize nums1 and nums2 with the number of elements m and n, respectively.
You can assume that nums1 has enough space (space size greater than or equal to m + n) to hold the elements in nums2.
Examples:
Input:nums1 = [1,2,3,0,0,0], m = 3nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
parsing
This topic is very simple, today opportunistic once, we know that the two arrays given in the topic are already sorted arrays, do not need us to sort, and nums1 has also set aside the corresponding position. Here is the solution
First copy nums2 to nums1, followed by 0, and then use the sort function to sort nums1, done!
complete code
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
for(int i = 0 ; i < n ; i++){
nums1[m+i] = nums2[i];
}
sort(nums1.begin(),nums1.end());
}
};
"Java how to merge two ordered arrays" content is introduced here, thank you for reading. If you want to know more about industry-related knowledge, you can pay attention to the website. Xiaobian will output more high-quality practical articles for everyone!
