add 867

Author: fishercoder1534

Diff for: README.md

@@ -34,6 +34,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |900|[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_900.java) | O(n) | O(1) | |Easy|
 |896|[Monotonic Array](https://leetcode.com/problems/monotonic-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_896.java) | O(n) | O(1) | |Easy|
 |884|[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_884.java) | O(n) | O(k) | |Easy|
+|867|[Transpose Matrix](https://leetcode.com/problems/transpose-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_867.java) | O(r*c) | O(r*c) | |Easy|
 |852|[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_852.java) | O(n) | O(1) | |Easy|
 |844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_844.java) | O(n) | O(1) | |Easy|
 |832|[Flipping an Image](https://leetcode.com/problems/flipping-an-image/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_832.java) | O(n) | O(1) | |Easy|

Diff for: src/main/java/com/fishercoder/solutions/_867.java

@@ -0,0 +1,15 @@
+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;
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/_867Test.java

@@ -0,0 +1,78 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._867;
+import com.fishercoder.solutions._9;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+import static org.junit.Assert.assertEquals;
+
+public class _867Test {
+    private static _867.Solution1 solution1;
+    private static int[][] A;
+    private static int[][] result;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _867.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        A = new int[][]{
+                {1, 2, 3},
+                {4, 5, 6},
+                {7, 8, 9}
+        };
+        result = new int[][]{
+                {1, 4, 7},
+                {2, 5, 8},
+                {3, 6, 9}
+        };
+        assertArrayEquals(result, solution1.transpose(A));
+    }
+
+    @Test
+    public void test2() {
+        A = new int[][]{
+                {1, 2, 3}
+        };
+        result = new int[][]{
+                {1},
+                {2},
+                {3}
+        };
+        assertArrayEquals(result, solution1.transpose(A));
+    }
+
+    @Test
+    public void test3() {
+        A = new int[][]{
+                {1},
+                {2},
+                {3}
+        };
+        result = new int[][]{
+                {1, 2, 3}
+        };
+        assertArrayEquals(result, solution1.transpose(A));
+    }
+
+    @Test
+    public void test4() {
+        A = new int[][]{
+                {1, 2, 3, 4},
+                {5, 6, 7, 8},
+                {9, 10, 11, 12}
+        };
+        result = new int[][]{
+                {1, 5, 9},
+                {2, 6, 10},
+                {3, 7, 11},
+                {4, 8, 12}
+        };
+        assertArrayEquals(result, solution1.transpose(A));
+    }
+
+}