#595 · #785 · Is Graph Bipartite?(判断二分图)

There is an undirected graph with n nodes where graph[i] lists the neighbours of node i. Return whether the graph is bipartite: the nodes can be split into two sets with every edge crossing between them. Constraints: 1 <= n <= 100, 0 <= graph[i].length < n, no self-loops or parallel edges.