package com.fishercoder.solutions;

/**
 * 867. Transpose Matrix
 *
 * Given a matrix A, return the transpose of A.
 * The transpose of a matrix is the matrix flipped over it's main diagonal, switching the row and column indices of the matrix.
 *
 * Example 1:
 *
 * Input: [[1,2,3],[4,5,6],[7,8,9]]
 * Output: [[1,4,7],[2,5,8],[3,6,9]]
 * Example 2:
 *
 * Input: [[1,2,3],[4,5,6]]
 * Output: [[1,4],[2,5],[3,6]]
 *
 * Note:
 *
 * 1 <= A.length <= 1000
 * 1 <= A[0].length <= 1000
 * */
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;
        }
    }
}

@@ -33,459 +33,8 @@
 s;%0A%0A
-/**%0A * 867. Transpose Matrix%0A *%0A * Given a matrix A, return the transpose of A.%0A * The transpose of a matrix is the matrix flipped over it's main diagonal, switching the row and column indices of the matrix.%0A *%0A * Example 1:%0A *%0A * Input: %5B%5B1,2,3%5D,%5B4,5,6%5D,%5B7,8,9%5D%5D%0A * Output: %5B%5B1,4,7%5D,%5B2,5,8%5D,%5B3,6,9%5D%5D%0A * Example 2:%0A *%0A * Input: %5B%5B1,2,3%5D,%5B4,5,6%5D%5D%0A * Output: %5B%5B1,4%5D,%5B2,5%5D,%5B3,6%5D%5D%0A *%0A * Note:%0A *%0A * 1 %3C= A.length %3C= 1000%0A * 1 %3C= A%5B0%5D.length %3C= 1000%0A * */%0A
 publ

refactor 867