fd

Author: dingjikerbo

test/src/main/java/com/inuker/test/main.java

@@ -22,24 +22,10 @@
 public class main {
 
     public static void main(String[] args) {
+
     }
 
-    public int lengthLongestPath(String input) {
-        Stack<Integer> stack = new Stack<Integer>();
-        int max = 0;
-        for (String line : input.split("\n")) {
-            int depth = line.lastIndexOf("\t") + 1;
-            while (stack.size() > depth) {
-                stack.pop();
-            }
-            int parentLen = stack.isEmpty() ? 0 : stack.peek();
-            int len = parentLen + line.length() - depth;
-            if (line.contains(".")) {
-                max = Math.max(len, max);
-            } else {
-                stack.push(len + 1);
-            }
-        }
-        return max;
+    public String nextClosestTime(String time) {
+
     }
 }