2017年11月10日
[LintCode] Graph Valid Tree
摘要： Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges mak 阅读全文
posted @ 2017-11-10 13:06 Review->Improve 阅读(540) 评论(0) 推荐(0)
[LintCode] Search Graph Nodes
摘要： Given a undirected graph, a node and a target, return the nearest node to given node which value of it is target, return NULL if you can't find. There 阅读全文
posted @ 2017-11-10 11:14 Review->Improve 阅读(846) 评论(0) 推荐(0)