摘要：
class Solution { public int lengthLongestPath(String input) { if (input.length() == 0) return 0; String[] layers = input.split("\n"); int[] stack = new int[layers.length +... 阅读全文
摘要：
1. Use priority queue. Need to check whether one element has been double counted: 2 Binary search: For this kind of matrix, binary search should work 阅读全文