fix: remove duplicate insertion to visited set (doocs#1907)

Author: Lai-YT

solution/2600-2699/2662.Minimum Cost of a Path With Special Roads/README.md

@@ -92,7 +92,6 @@ class Solution:
                 continue
             vis.add((x, y))
             ans = min(ans, d + dist(x, y, *target))
-            vis.add((x, y))
             for x1, y1, x2, y2, cost in specialRoads:
                 heappush(q, (d + dist(x, y, x1, y1) + cost, x2, y2))
         return ans

solution/2600-2699/2662.Minimum Cost of a Path With Special Roads/README_EN.md

@@ -86,7 +86,6 @@ class Solution:
                 continue
             vis.add((x, y))
             ans = min(ans, d + dist(x, y, *target))
-            vis.add((x, y))
             for x1, y1, x2, y2, cost in specialRoads:
                 heappush(q, (d + dist(x, y, x1, y1) + cost, x2, y2))
         return ans

solution/2600-2699/2662.Minimum Cost of a Path With Special Roads/Solution.py

@@ -14,7 +14,6 @@ def dist(x1: int, y1: int, x2: int, y2: int) -> int:
                 continue
             vis.add((x, y))
             ans = min(ans, d + dist(x, y, *target))
-            vis.add((x, y))
             for x1, y1, x2, y2, cost in specialRoads:
                 heappush(q, (d + dist(x, y, x1, y1) + cost, x2, y2))
         return ans