@@ -0,0 +1,922 @@
+%22%22%22Leetcode 1197. Minimum Knight Moves%0AMedium%0A%0AURL: https://leetcode.com/problems/minimum-knight-moves/%0A%0AIn an infinite chess board with coordinates from -infinity to +infinity,%0Ayou have a knight at square %5B0, 0%5D.%0A%0AA knight has 8 possible moves it can make, as illustrated below.%0AEach move is two squares in a cardinal direction, then one square in an%0Aorthogonal direction.%0A%0AReturn the minimum number of steps needed to move the knight to the square %5Bx, y%5D.%0AIt is guaranteed the answer exists.%0A%0AExample 1:%0AInput: x = 2, y = 1%0AOutput: 1%0AExplanation: %5B0, 0%5D %E2%86%92 %5B2, 1%5D%0A%0AExample 2:%0AInput: x = 5, y = 5%0AOutput: 4%0AExplanation: %5B0, 0%5D %E2%86%92 %5B2, 1%5D %E2%86%92 %5B4, 2%5D %E2%86%92 %5B3, 4%5D %E2%86%92 %5B5, 5%5D%0A%0AConstraints:%0A%7Cx%7C + %7Cy%7C %3C= 300%0A%22%22%22%0A%0A%0Aclass Solution(object):%0A    def minKnightMoves(self, x, y):%0A        %22%22%22%0A        :type x: int%0A        :type y: int%0A        :rtype: int%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc1197_minimum_knight_moves.py