-
Notifications
You must be signed in to change notification settings - Fork 9
/
Merge Sorted Array.cpp
37 lines (30 loc) · 952 Bytes
/
Merge Sorted Array.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
// PROBLEM :-
// https://leetcode.com/problems/merge-sorted-array/
// LEETCODE | EASY | ARRAY - TWO POINTERS
// Solution :- T.C: O(N + M) and S.C: O(1)
// begin from last index of both array, compare two elements from both array,
// and overwrite in the last available position of nums1 (as it is meant to be INPLACE).
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int itrA = m - 1;
int itrB = n - 1;
int itr = m + n - 1;
while(itrA >= 0 && itrB >= 0){
if(nums1[itrA] > nums2[itrB]){
nums1[itr] = nums1[itrA];
itr--;
itrA--;
}else{
nums1[itr] = nums2[itrB];
itr--;
itrB--;
}
}
while(itrB >= 0){
nums1[itr] = nums2[itrB];
itr--;
itrB--;
}
}
};