lintcode 두 그룹의 오류를 구합니다
1170 단어 lintcode
#include
#include
#include
using namespace std;
class Solution {
public:
/**
* @param nums1 an integer array
* @param nums2 an integer array
* @return an integer array
*/
vector intersection(vector& nums1, vector& nums2) {
// Write your code here
sort(nums1.begin(),nums1.end());
sort(nums2.begin(),nums2.end());//
vector output;
int len1=nums1.size();
int len2=nums2.size();
int i,j;//
for(i=0;inums2[j])
j++;// ,
else if(nums1[i]==nums2[j])
{
output.push_back(nums1[i]);
i++;
j++;// ,
}
}
return output;
}
};
void main()
{
Solution test;
vector nums1;
vector nums2;
vector output;
int c1,c2;
cout<c1)
{
nums1.push_back(c1);
if(cin.get()=='
')
break;
}
cout<c2)
{
nums2.push_back(c2);
if(cin.get()=='
')
break;
}
output=test.intersection(nums1,nums2);
vector::iterator it;
cout<