摘要：
1 public class Solution { 2 public String alienOrder(String[] words) { 3 if (words.length == 0) { 4 return ""; 5 } 6 StringBuilder result = new StringBui... 阅读全文
摘要：
1 public class Solution { 2 public int kthSmallest(int[][] matrix, int k) { 3 if (matrix.length == 0 || matrix[0].length == 0 || k queue = new PriorityQueue(); 7 for (int i =... 阅读全文
摘要：
1 public class PhoneDirectory { 2 private boolean[] nums; 3 private Queue queue; 4 /** Initialize your data structure here 5 @param maxNumbers - The maximum numbers that can ... 阅读全文