add 4061

Author: fishercoder1534

paginated_contents/algorithms/5th_thousand/README.md

@@ -1,6 +1,7 @@
 | #    | Title                                                                                                                                                                                 | Solutions                                                                                                                        | Video                                | Difficulty | Tag                                                                  
 |------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------|--------------------------------------|------------|----------------------------------------------------------------------
 | 4065 | [Rearrange Array by Removing Distinct Values](https://leetcode.com/problems/rearrange-array-by-removing-distinct-values/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4065.java) |                                      | Easy       |
+| 4061 | [Minimum Queen Moves to Reach Target](https://leetcode.com/problems/minimum-queen-moves-to-reach-target/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4061.java) |                                      | Easy       |
 | 4056 | [Number of Intersecting Interval Pairs I](https://leetcode.com/problems/number-of-intersecting-interval-pairs-i/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4056.java) |                                      | Easy       |
 | 4052 | [Cyclically Shift Rows and Columns](https://leetcode.com/problems/cyclically-shift-rows-and-columns/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4052.java) |                                      | Easy       |
 | 4048 | [Count Values With Equally Spaced Occurrences I](https://leetcode.com/problems/count-values-with-equally-spaced-occurrences-i/)                                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fifththousand/_4048.java) |                                      | Easy       |

src/main/java/com/fishercoder/solutions/fifththousand/_4061.java

@@ -0,0 +1,25 @@
+package com.fishercoder.solutions.fifththousand;
+
+public class _4061 {
+    public static class Solution1 {
+        /**
+         * Only three possible answers: 0, 1, 2:
+         *
+         * 1. If they are at the same position, then zero;
+         * 2. If they share the same row, or column, or diagonal, one only move is needed;
+         * 3. In all other cases, they can make two moves to reach
+         */
+        public int minQueenMoves(int[] source, int[] target) {
+            if (source[0] == target[0] && source[1] == target[1]) {
+                return 0;
+            } else if (Math.abs(source[0] - target[0]) == Math.abs(source[1] - target[1]) //this means they are on the same diagonal
+                    || source[0] == target[0] // this means they are on the same row
+                    || source[1] == target[1] // this means they are on the same column
+            ) {
+                return 1;
+            } else {
+                return 2;
+            }
+        }
+    }
+}

src/test/java/com/fishercoder/fifththousand/_4061Test.java

@@ -0,0 +1,21 @@
+package com.fishercoder.fifththousand;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import com.fishercoder.solutions.fifththousand._4061;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+public class _4061Test {
+    private _4061.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _4061.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.minQueenMoves(new int[] {1, 8}, new int[] {3, 1}));
+    }
+}