2019年3月22日
847. Shortest Path Visiting All Nodes
摘要： An undirected, connected graph of N nodes (labeled 0, 1, 2, ..., N-1) is given as graph. graph.length = N, and j != i is in the list graph[i] exactly 阅读全文
posted @ 2019-03-22 21:37 Veritas_des_Liberty 阅读(270) 评论(0) 推荐(0)
838. Push Dominoes
摘要： There are N dominoes in a line, and we place each domino vertically upright. In the beginning, we simultaneously push some of the dominoes either to t 阅读全文
posted @ 2019-03-22 21:04 Veritas_des_Liberty 阅读(394) 评论(0) 推荐(0)