Union of Two Sorted Arrays with Distinct Elements | Arrays | MEDIUM

[@galepraveen]

vector findUnion(vector &a, vector &b) { int n = a.size(), m = b.size(); int i = 0, j = 0; vector res; while(i < n && j < m){ int num1 = a[i], num2 = b[j]; if(num1 == num2){ res.push_back(num1); i += 1; j += 1; } else if(num1 < num2){ res.push_back(num1); i += 1; }else{ res.push_back(num2); j += 1; } } while(i < n){ res.push_back(a[i]); i += 1; } while(j < m){ res.push_back(b[j]); j += 1; } return res; }