package com.fishercoder.solutions;

public class _867 {
    public static class Solution1 {
        public int[][] transpose(int[][] A) {
            int[][] result = new int[A[0].length][A.length];
            for (int i = 0; i < A.length; i++) {
                for (int j = 0; j < A[0].length; j++) {
                    result[j][i] = A[i][j];
                }
            }
            return result;
        }
    }
}

@@ -126,17 +126,22 @@
 int%5B%5D%5B%5D 
-A
+matrix
 ) %7B%0A    
@@ -173,17 +173,22 @@
 new int%5B
-A
+matrix
 %5B0%5D.leng
@@ -191,17 +191,22 @@
 length%5D%5B
-A
+matrix
 .length%5D
@@ -239,17 +239,22 @@
  0; i %3C 
-A
+matrix
 .length;
@@ -297,17 +297,22 @@
  0; j %3C 
-A
+matrix
 %5B0%5D.leng
@@ -361,9 +361,14 @@
 %5D = 
-A
+matrix
 %5Bi%5D%5B

update method signature