Implement minQueenMoves function for queen moves

Author: jyoung2419

leetcode3/정진영/4061. Minimum Queen Moves to Reach Target

@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} source
+ * @param {number[]} target
+ * @return {number}
+ */
+var minQueenMoves = function(source, target) {
+    // 8x8
+    // 같은 좌표: 0
+    // 대각선 라인, 같은 행, 열: 1
+    // else: 2
+    if (source[0] == target[0] && source[1] == target[1]) {
+        return 0;
+    } if (
+        (Math.abs(source[0] - target[0]) == Math.abs(source[1] - target[1])) || (source[0] == target[0] && source[1] !== target[1]) || 
+        (source[0] !== target[0] && source[1] == target[1])
+        ) return 1;
+    
+    return 2;
+};