feat: add solutions to leetcode problem: No.1497. Check If Array Pairs Are Divisible by k

Author: yanglbme

solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README.md

@@ -71,15 +71,57 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def isPathCrossing(self, path: str) -> bool:
+        x = y = 0
+        visited = set()
+        visited.add('0.0')
+        for c in path:
+            if c == 'N':
+                y += 1
+            elif c == 'S':
+                y -= 1
+            elif c == 'E':
+                x += 1
+            else:
+                x -= 1
+            pos = f'{x}.{y}'
+            if pos in visited:
+                return True
+            visited.add(pos)
+        return False
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean isPathCrossing(String path) {
+        Set<String> visited = new HashSet<>();
+        visited.add("0.0");
+        int x = 0, y = 0;
+        for (int i = 0; i < path.length(); ++i) {
+            char c = path.charAt(i);
+            if (c == 'N') {
+                ++y;
+            } else if (c == 'S') {
+                --y;
+            } else if (c == 'E') {
+                ++x;
+            } else {
+                --x;
+            }
+            String pos = x + "." + y;
+            if (visited.contains(pos)) {
+                return true;
+            }
+            visited.add(pos);
+        }
+        return false;
+    }
+}
 ```
 
 ### **...**

solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README_EN.md

@@ -68,13 +68,55 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def isPathCrossing(self, path: str) -> bool:
+        x = y = 0
+        visited = set()
+        visited.add('0.0')
+        for c in path:
+            if c == 'N':
+                y += 1
+            elif c == 'S':
+                y -= 1
+            elif c == 'E':
+                x += 1
+            else:
+                x -= 1
+            pos = f'{x}.{y}'
+            if pos in visited:
+                return True
+            visited.add(pos)
+        return False
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean isPathCrossing(String path) {
+        Set<String> visited = new HashSet<>();
+        visited.add("0.0");
+        int x = 0, y = 0;
+        for (int i = 0; i < path.length(); ++i) {
+            char c = path.charAt(i);
+            if (c == 'N') {
+                ++y;
+            } else if (c == 'S') {
+                --y;
+            } else if (c == 'E') {
+                ++x;
+            } else {
+                --x;
+            }
+            String pos = x + "." + y;
+            if (visited.contains(pos)) {
+                return true;
+            }
+            visited.add(pos);
+        }
+        return false;
+    }
+}
 ```
 
 ### **...**

solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/Solution.java

@@ -0,0 +1,25 @@
+class Solution {
+    public boolean isPathCrossing(String path) {
+        Set<String> visited = new HashSet<>();
+        visited.add("0.0");
+        int x = 0, y = 0;
+        for (int i = 0; i < path.length(); ++i) {
+            char c = path.charAt(i);
+            if (c == 'N') {
+                ++y;
+            } else if (c == 'S') {
+                --y;
+            } else if (c == 'E') {
+                ++x;
+            } else {
+                --x;
+            }
+            String pos = x + "." + y;
+            if (visited.contains(pos)) {
+                return true;
+            }
+            visited.add(pos);
+        }
+        return false;
+    }
+}

solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/Solution.py

@@ -0,0 +1,19 @@
+class Solution:
+    def isPathCrossing(self, path: str) -> bool:
+        x = y = 0
+        visited = set()
+        visited.add('0.0')
+        for c in path:
+            if c == 'N':
+                y += 1
+            elif c == 'S':
+                y -= 1
+            elif c == 'E':
+                x += 1
+            else:
+                x -= 1
+            pos = f'{x}.{y}'
+            if pos in visited:
+                return True
+            visited.add(pos)
+        return False

test.py

@@ -0,0 +1,23 @@
+class Solution:
+    def isPathCrossing(self, path: str) -> bool:
+        x = y = 0
+        visited = set()
+        visited.add(f'{x}.{y}')
+        for c in path:
+            if c == 'N':
+                y += 1
+            elif c == 'S':
+                y -= 1
+            elif c == 'E':
+                x += 1
+            else:
+                x -= 1
+            pos = f'{x}.{y}'
+            if pos in visited:
+                return True
+            visited.add(pos)
+        return False
+
+
+if __name__ == '__main__':
+    print(Solution().isPathCrossing("NESWW"))