package leetcode;

/**
 * https://leetcode.com/problems/transpose-matrix/
 */
public class Problem868 {
    public int[][] transpose(int[][] A) {
        // TODO
        return null;
    }

    public static void main(String[] args) {
        Problem868 prob = new Problem868();
    }
}

@@ -272,16 +272,386 @@
 m868();%0A
+        // %5B1, 4, 7%5D,%0A        // %5B2, 5, 8%5D,%0A        // %5B3, 6, 9%5D%0A        System.out.println(prob.transpose(new int%5B%5D%5B%5D%7B%0A            %7B1, 2, 3%7D,%0A            %7B4, 5, 6%7D,%0A            %7B7, 8, 9%7D%0A        %7D));%0A        // %5B1, 4%5D,%0A        // %5B2, 5%5D,%0A        // %5B3, 6%5D%0A        System.out.println(prob.transpose(new int%5B%5D%5B%5D%7B%0A            %7B1, 2, 3%7D,%0A            %7B4, 5, 6%7D%0A        %7D));%0A
     %7D%0A%7D%0A

Update problem 868