add 1886

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1886|[Determine Whether Matrix Can Be Obtained By Rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1886.java) ||Easy|Array|
 |1880|[Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1880.java) ||Easy|String|
 |1877|[Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1877.java) ||Medium|Greedy, Sort|
 |1876|[Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1876.java) ||Easy|String|

src/main/java/com/fishercoder/solutions/_1886.java

@@ -0,0 +1,82 @@
+package com.fishercoder.solutions;
+
+public class _1886 {
+    public static class Solution1 {
+        public boolean findRotation(int[][] mat, int[][] target) {
+            int m = mat.length;
+            int n = mat[0].length;
+            for (int i = 0; i < m; i++) {
+                int j = 0;
+                for (; j < n; j++) {
+                    if (mat[i][j] != target[i][j]) {
+                        break;
+                    }
+                }
+                if (j < n) {
+                    break;
+                } else if (i == m - 1) {
+                    return true;
+                }
+            }
+
+            //rotate 90 degrees once
+            for (int i = 0, k = n - 1; i < m; i++, k--) {
+                int j = 0;
+                for (; j < n; j++) {
+                    if (mat[i][j] != target[j][k]) {
+                        break;
+                    }
+                }
+                if (j < n) {
+                    break;
+                } else if (i == m - 1) {
+                    return true;
+                }
+            }
+            int[][] rotated = new int[m][n];
+            for (int i = 0, k = n - 1; i < m; i++, k--) {
+                for (int j = 0; j < n; j++) {
+                    rotated[j][k] = mat[i][j];
+                }
+            }
+
+            //rotate 90 degrees the second time
+            for (int i = 0, k = n - 1; i < m; i++, k--) {
+                int j = 0;
+                for (; j < n; j++) {
+                    if (rotated[i][j] != target[j][k]) {
+                        break;
+                    }
+                }
+                if (j < n) {
+                    break;
+                } else if (i == m - 1) {
+                    return true;
+                }
+            }
+            int[][] rotated2 = new int[m][n];
+            for (int i = 0, k = n - 1; i < m; i++, k--) {
+                int j = 0;
+                for (; j < n; j++) {
+                    rotated2[j][k] = rotated[i][j];
+                }
+            }
+
+            //rotate 90 degrees the third time
+            for (int i = 0, k = n - 1; i < m; i++, k--) {
+                int j = 0;
+                for (; j < n; j++) {
+                    if (rotated2[i][j] != target[j][k]) {
+                        break;
+                    }
+                }
+                if (j < n) {
+                    break;
+                } else if (i == m - 1) {
+                    return true;
+                }
+            }
+            return false;
+        }
+    }
+}

src/test/java/com/fishercoder/_1886Test.java

@@ -0,0 +1,52 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1886;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1886Test {
+    private static _1886.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1886.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.findRotation(new int[][]{
+                {0, 1},
+                {1, 0}
+        }, new int[][]{
+                {1, 0},
+                {0, 1}
+        }));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(false, solution1.findRotation(new int[][]{
+                {0, 1},
+                {1, 1}
+        }, new int[][]{
+                {1, 0},
+                {0, 1}
+        }));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(true, solution1.findRotation(new int[][]{
+                {0, 0, 0},
+                {0, 1, 0},
+                {1, 1, 1}
+        }, new int[][]{
+                {1, 1, 1},
+                {0, 1, 0},
+                {0, 0, 0}
+        }));
+    }
+
+}