problem0847

README

847. Shortest Path Visiting All Nodes

题目

An undirected, connected graph of N nodes (labeled0, 1, 2, ..., N-1) is given as graph.

graph.length = N, and j != iis in the listgraph[i]exactly once, if and only if nodes i and j are connected.

Return the length of the shortest path that visits every node. You may start and stop at any node, you may revisit nodes multiple times, and you may reuse edges.

Example 1:

Input: [[1,2,3],[0],[0],[0]]
Output: 4
Explanation: One possible path is [1,0,2,0,3]

Example 2:

Input: [[1],[0,2,4],[1,3,4],[2],[1,2]]
Output: 4
Explanation: One possible path is [0,1,4,2,3]

Note:

1. 1 <= graph.length <= 12
2. 0 <= graph[i].length < graph.length

解题思路

见程序注释