867 转置矩阵

  1. class Solution {
  2. public int[][] transpose(int[][] A) {
  3. int[][] ans = new int[A[0].length][A.length];
  4. for(int i = 0; i < A.length; i++)
  5. for (int j = 0; j < A[0].length; j++)
  6. ans[j][i] = A[i][j];
  7. return ans;
  8. }
  9. }