Eassiest c++ solution


#1

void Solution::merge(vector &a, vector &b) {
for(int i=0;i<b.size();i++){
a.push_back(b[i]);
}
sort(a.begin(),a.end());

}


#2

This is not O(m+n) this is O(m+n)log(m+n) …