记录贴，互勉

990. Satisfiability of Equality Equations
union-find solution:
Union the == character.   
Compare the != root

721. Accounts Merge
1. map email to id
2. If the same email maps to a different id, union these two ids
3. put the email together with the root Id
4. sort the email and put them to an array, add the account name to the top.

737. Sentence Similarity II
map a word to id, and union the id of each group

785. Is Graph Bipartite?
Graph coloring, For all node, the color as 1 or 2, if not visited should be 0 in the array.
If the current node and its neighbor have the same color, return false, else continue to color it as the opposite color

886. Possible Bipartition
Same as 785,  but we need to build our graph first before do the coloring
And also the problem provided n is the number of people but not the number of dislike group

补充内容 (2023-10-04 08:07 +08:00):



补充内容 (2023-10-04 08:08 +08:00):

BFS approach

1042. Flower Planting With No Adjacent