摘要:
leetcode 1045 select customer_id from (select customer_id,count(*) m from (select distinct * from Customer) a group by customer_id having count(*) in 阅读全文
摘要:
leetcode240 思路:我们将矩阵逆时针旋转45度,可以发现矩阵变成了一个二叉搜索树,往左走是小,往右走是大。这样就能以matrix[0] [j]为根开始搜索。 class Solution { //10:20~10:28 public boolean doSearch(int[][] mat 阅读全文