PengHongfu
PengHongfu
```java class Solution { int length; HashMap map; Random random; public Solution(int n, int[] blacklist) { random = new Random(); //因为黑名单都在n中,所以,随机数在[0,length)中取 length = n - blacklist.length; map = new HashMap();...
48题 旋转图像 按照左上到右下的对角线进行镜像对称,反转二维矩阵这里应该是翻转列 ```java // 然后反转二维矩阵的前后行 for (int[] row : matrix) { reverse(row); } ``` ```java //LC48 逆时针时针90度翻转 public void rotate1(int[][] matrix) { int n = matrix.length; //沿45度角对折 for (int...