删除两个数组交集

最新推荐文章于 2023-03-01 20:50:47 发布

原创最新推荐文章于 2023-03-01 20:50:47 发布 · 441 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#delete #system

数据结构算法专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一个模板函数，用于从两个已排序的整数数组中删除它们的交集，并将结果写入第三个输出迭代器指向的容器。通过示例展示了如何使用此函数处理两个数组，并输出各自及处理后的结果。

#include<iostream> #include<string> #include<vector> #include<iomanip> #include<stdlib.h> #include <stdio.h> #include <stddef.h> #include <iterator> #include <algorithm> using namespace std; template <typename InputIterator1, typename InputIterator2, typename OutputIterator> OutputIterator delete_intersection(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator dest) { while (first1 != last1 && first2 != last2) { if (*first1 > *first2) { *dest = *first2; ++first2; ++dest; } else if (*first1 < *first2) { *dest = *first1; ++first1; ++dest; } else { ++first1; ++first2; } } // for (;first1 != last1; ++first1) *dest = *first1; for (;first2 != last2; ++first2) *dest = *first2; return dest; } int main() { int a[] = {1,1,2,2,5,6,9,9}; int b[] = {1,2,3,4,4,6,7,8,9,9,9,10}; vector<int> vc; delete_intersection(a, a + sizeof(a)/sizeof(a[0]), b, b + sizeof(b)/sizeof(b[0]), back_inserter(vc)); std::copy(a, a + sizeof(a)/sizeof(a[0]), ostream_iterator<int>(cout, ",")); cout << endl; std::copy(b, b + sizeof(b)/sizeof(b[0]), ostream_iterator<int>(cout, ",")); cout << endl; std::copy(vc.begin(), vc.end(), ostream_iterator<int>(cout, ",")); cout << endl; ::system("PAUSE"); return EXIT_SUCCESS; }