add 1496

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1496|[Path Crossing](https://leetcode.com/problems/path-crossing/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1496.java) | |Easy|String|
 |1493|[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1493.java) | |Medium|Array|
 |1492|[The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1492.java) | |Medium|Math|
 |1491|[Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1491.java) | |Easy|Array, Sort|

src/main/java/com/fishercoder/solutions/_1496.java

@@ -0,0 +1,66 @@
+package com.fishercoder.solutions;
+
+import java.util.Objects;
+import java.util.Stack;
+
+public class _1496 {
+    public static class Solution1 {
+        public boolean isPathCrossing(String path) {
+            Stack<Coord> visited = new Stack<>();
+            visited.add(new Coord(0, 0));
+            for (char c : path.toCharArray()) {
+                Coord last = visited.peek();
+                if (c == 'N') {
+                    Coord nextStep = new Coord(last.x, last.y + 1);
+                    if (visited.contains(nextStep)) {
+                        return true;
+                    }
+                    visited.add(nextStep);
+                } else if (c == 'S') {
+                    Coord nextStep = new Coord(last.x, last.y - 1);
+                    if (visited.contains(nextStep)) {
+                        return true;
+                    }
+                    visited.add(nextStep);
+                } else if (c == 'E') {
+                    Coord nextStep = new Coord(last.x - 1, last.y);
+                    if (visited.contains(nextStep)) {
+                        return true;
+                    }
+                    visited.add(nextStep);
+                } else if (c == 'W') {
+                    Coord nextStep = new Coord(last.x + 1, last.y);
+                    if (visited.contains(nextStep)) {
+                        return true;
+                    }
+                    visited.add(nextStep);
+                }
+            }
+            return false;
+        }
+
+        static class Coord {
+            int x;
+            int y;
+
+            public Coord(int x, int y) {
+                this.x = x;
+                this.y = y;
+            }
+
+            @Override
+            public boolean equals(Object o) {
+                if (this == o) return true;
+                if (o == null || getClass() != o.getClass()) return false;
+                Coord coord = (Coord) o;
+                return x == coord.x &&
+                        y == coord.y;
+            }
+
+            @Override
+            public int hashCode() {
+                return Objects.hash(x, y);
+            }
+        }
+    }
+}

src/test/java/com/fishercoder/_1496Test.java

@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1496;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1496Test {
+    private static _1496.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1496.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(false, solution1.isPathCrossing("NES"));
+    }
+
+}