add skeleton for 847

fishercoder1534 · fishercoder1534 · commit 706384a2bb49 · 2020-01-29T09:11:51.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_847.java b/src/main/java/com/fishercoder/solutions/_847.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions;
+
+/**
+ * 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 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 <= graph.length <= 12
+ * 0 <= graph[i].length < graph.length
+ * */
+public class _847 {
+    public static class Solution1 {
+        public int shortestPathLength(int[][] graph) {
+            //TODO: implement this
+            return -1;
+        }
+    }
+}
