数据结构
网络
关系型数据库管理系统
操作系统
Java
MS Excel
iOS
HTML
CSS
Android
Python
C 编程
C++
C#
MongoDB
MySQL
Javascript
PHP
物理学
化学
生物学
数学
英语
经济学
心理学
社会学
时尚研究
法律研究检查给定的两个集合是否是 disjoint 集合？
当两个集合没有公共元素时，它们是 disjoint 集合。换句话说，如果我们得到两个集合的交集，那么我们将会得到空集。
该方法很简单，在这个算法中，给定了两个集合。我们假设这两个集合已经被排序，在两个集合之间比较项。当匹配时，它不是一个 disjoint 集合，当没有项匹配时，它们是 disjoint 集合。
输入和输出
Input:
Two sets:
set1: {15, 12, 36, 21, 14}
set2: {7, 89, 56, 32}
Output:
Both sets are disjoint算法
isDisjoint(set1, set2)
输入：两个集合。
输出：当两个集合都是 disjoint 集合时为 True。
Begin i1 := start of first set i2 := start of second set while i1 in set1 and i2 in set 2, do if set1[i1] < set2[i2], then i1 := i1 + 1 else if set2[i2] < set1[i1], then i2 := i2 + 1 else return false done return true End
示例
#include<iostream>
#include<set>
using namespace std;
bool isDisjoint(set<int> set1, set<int> set2) {
set<int>::iterator i1, i2;
i1 = set1.begin(); i2 = set2.begin(); //initialize iterators with first element
while(i1 != set1.end() && i2 != set2.end()) { //when both set have some elements to check
if(*i1 < *i2)
i1++; //when item of first set is less than second set
else if(*i2 < *i1)
i2++; //when item of second set is less than first set
else
return false; //if items are matched, sets are not disjoint
}
return true;
}
int main() {
set<int> set1, set2;
int n1, n2;
cout << "Enter number of elements in set 1: "; cin >>n1;
while(n1 != set1.size()) { //duplicate items will be discarded
int item;
cout << "Enter element: "; cin >> item;
set1.insert(item);
}
cout << "Enter number of elements in set 2: "; cin >>n2;
while(n2 != set2.size()) {
int item;
cout << "Enter element: "; cin >> item;
set2.insert(item);
}
if(isDisjoint(set1, set2))
cout << "Both sets are disjoint";
else
cout << "Sets are not disjoint";
}输出
Enter number of elements in set 1: 5 Enter element: 15 Enter element: 12 Enter element: 36 Enter element: 21 Enter element: 14 Enter number of elements in set 2: 4 Enter element: 7 Enter element: 89 Enter element: 56 Enter element: 32 Both sets are disjoint
更新于： 2020 年 6 月 17 日
648 次浏览
广告