LeetCode-Problems/Medium Problems/88_Merge_Sorted_Array.cpp at main · UdaySharmaGitHub/LeetCode-Problems · GitHub

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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
//-------------------------------------------------------------------------------------------------//
class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        for (int j = 0, i = m; j<n; j++){
            nums1[i] = nums2[j];
            i++;
        }
        sort(nums1.begin(),nums1.end());
    }
};
//-------------------------------------------------------------------------------------------------//
class Solution {
public:
   void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
         int i = m - 1;
        int j = n - 1;
        int k = m + n - 1;

        while (j >= 0) {
            if (i >= 0 && nums1[i] > nums2[j]) {
                nums1[k--] = nums1[i--];
            } else {
                nums1[k--] = nums2[j--];
            }
        }
    }

};
class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        vector<int>merge;
        int i = 0 , j = 0;
        while(i<m && j<n){
            if(nums1[i]<nums2[j]){
                merge.push_back(nums1[i++]);
            }
            else if(nums1[i]>nums2[j]){
                merge.push_back(nums2[j++]);
            }
            else if(nums1[i]==nums2[j]){
                merge.push_back(nums1[i++]);
                merge.push_back(nums2[j++]);
            }
        }
        if(i!=m){
            while(i<m){
                 merge.push_back(nums1[i++]);
            }
        }
        else{
            while(j<n){
                 merge.push_back(nums2[j++]);
            }
        }
        nums1 = merge;
    }
};
//-------------------------------------------------------------------------------------------------//
class Solution {
public:
   void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
             vector<int> ans(m+n);
        int i=0,j=0,k=0;
        while(i<m && j<n){
           if(nums1[i] > nums2[j]){
               ans[k]=nums2[j];
               k++,j++;
           }
           else{
             ans[k]=nums1[i];
               k++,i++;
           }
        }
        while(i<m){
              ans[k]=nums1[i];
               k++,i++;
        }
              while(j<n){
              ans[k]=nums2[j];
               k++,j++;
        }
        for(auto x:ans){
            cout<<x<<"\t";
        }
    }

};
int main(){
    Solution s;
    int n,m;
    cin>>m;
    vector<int> nums1(m);
    for(int i=0;i<m;i++){
        cin>>nums1[i];
    }
    cin>>n;
    vector<int> nums2(n);
    for(int i=0;i<n;i++){
        cin>>nums2[i];
    }
    s.merge(nums1,m,nums2,n);
}