Update 3996. Even Number of Knight Moves.py

Author: okwow123

leetcode3/김민제/3996. Even Number of Knight Moves.py

@@ -2,7 +2,7 @@ class Solution:
     def canReach(self, start: list[int], target: list[int]) -> bool:
         start_parity = (start[0]+start[1])%2
         target_paritiy = (target[0]+target[1])%2
-
+        #test
         if start_parity == target_paritiy:
             return True
         else: