摘要:
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 阅读全文
摘要:
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 阅读全文