Commit c1725f2

authored

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

1 parent c12f418 commit c1725f2Copy full SHA for c1725f2

File tree

-3

lines changed

-3

lines changed

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -92,7 +92,6 @@ class Solution:`
`92`	`92`	`continue`
`93`	`93`	`vis.add((x, y))`
`94`	`94`	`ans = min(ans, d + dist(x, y, *target))`
`95`		`- vis.add((x, y))`
`96`	`95`	`for x1, y1, x2, y2, cost in specialRoads:`
`97`	`96`	`heappush(q, (d + dist(x, y, x1, y1) + cost, x2, y2))`
`98`	`97`	`return ans`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -86,7 +86,6 @@ class Solution:`
`86`	`86`	`continue`
`87`	`87`	`vis.add((x, y))`
`88`	`88`	`ans = min(ans, d + dist(x, y, *target))`
`89`		`- vis.add((x, y))`
`90`	`89`	`for x1, y1, x2, y2, cost in specialRoads:`
`91`	`90`	`heappush(q, (d + dist(x, y, x1, y1) + cost, x2, y2))`
`92`	`91`	`return ans`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,6 @@ def dist(x1: int, y1: int, x2: int, y2: int) -> int:`
`14`	`14`	`continue`
`15`	`15`	`vis.add((x, y))`
`16`	`16`	`ans = min(ans, d + dist(x, y, *target))`
`17`		`- vis.add((x, y))`
`18`	`17`	`for x1, y1, x2, y2, cost in specialRoads:`
`19`	`18`	`heappush(q, (d + dist(x, y, x1, y1) + cost, x2, y2))`
`20`	`19`	`return ans`

Comments

(0)