每日新闻
2020.7.16
译文:
思路
DFS / BFS染色,并查集
代码
class Solution {
public:
//并查集版本
vector< int> father;
bool isBipartite (vector<vector>>& graph) {
int n=graph. size ();
father. assign (n, 0 );
for ( int i= 0 ;i<n;++i) father[i]=i;
for ( int i= 0 ;i<n;++i)
{
// if(father[i]!=i) continue;
if (graph[i]. size ()== 0 ) continue ;