摘要: This is a hard problem. If I got this problem the first time when I was interviewed, I would not be able to solve it. public int[] findDiagonalOrder(i 阅读全文
posted @ 2022-03-09 14:23 阳光明媚的菲越 阅读(17) 评论(0) 推荐(0) 编辑
摘要: This problem is different with 542. 01 Matrix and 286. Walls and Gates. 542 and 286 is once get the shortest path from one of the targets, then the ce 阅读全文
posted @ 2022-03-09 11:50 阳光明媚的菲越 阅读(22) 评论(0) 推荐(0) 编辑
摘要: The solution of this issue is as same as 542. 01 Matrix class Solution { int m, n; private int[][] dirs ={{-1,0},{1,0},{0,-1},{0,1}}; public void wall 阅读全文
posted @ 2022-03-09 05:18 阳光明媚的菲越 阅读(20) 评论(0) 推荐(0) 编辑
摘要: If you could find the secret of image rotate, then this would be a simple problem. 1. If you want to rotate the image by 90 degrees clockwise,then rev 阅读全文
posted @ 2022-03-09 03:57 阳光明媚的菲越 阅读(15) 评论(0) 推荐(0) 编辑