摘要: need to use scratch to find the pattern class Solution { public void rotate(int[][] matrix) { int n=matrix.length; for (int i=0; i<n/2; i++) for (int 阅读全文
posted @ 2019-12-04 09:14 La_Campanella 阅读(70) 评论(0) 推荐(0) 编辑
摘要: A classic BFS problem, that is, we use a Queue to store temporary solution and record the size of the current Queue. For each node in this BFS tree, w 阅读全文
posted @ 2019-12-04 07:09 La_Campanella 阅读(293) 评论(0) 推荐(0) 编辑