LeetCode 088 Merge Sorted Array

class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
vector<int>ans;
int ii=0;
int jj=0;
while(ii<m&&jj<n){
if(nums1[ii]<nums2[jj]){ans.push_back(nums1[ii]);ii++;}
else {ans.push_back(nums2[jj]);jj++;}
}
while(ii<m){ans.push_back(nums1[ii]);ii++;}
while(jj<n){ans.push_back(nums2[jj]);jj++;}
nums1.clear();
for(int kk=0;kk<ans.size();kk++)
nums1.push_back(ans[kk]);
}
};