Commitbe1dfc0

committed

refactor solution to pass updated test cases

1 parent5d3baf8 commitbe1dfc0Copy full SHA for be1dfc0

File tree

+21

-20

lines changed

+21

-20

lines changed

Lines changed: 21 additions & 20 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,27 +1,28 @@`
`1`	`1`	`classSolution:`
`2`	`2`	`deffindItinerary(self,tickets:List[List[str]])->List[str]:`
`3`		`-adj= {u:collections.deque()foru,vintickets}`
`4`		`-res= ["JFK"]`
	`3`	`+adj= {src: []forsrc,dstintickets}`
	`4`	`+res= []`
`5`	`5`
`6`		`-tickets.sort()`
`7`		`-foru,vintickets:`
`8`		`-adj[u].append(v)`
	`6`	`+forsrc,dstintickets:`
	`7`	`+adj[src].append(dst)`
`9`	`8`
`10`		`-defdfs(cur):`
`11`		`-iflen(res)==len(tickets)+1:`
`12`		`-returnTrue`
`13`		`-ifcurnotinadj:`
`14`		`-returnFalse`
	`9`	`+forkeyinadj:`
	`10`	`+adj[key].sort()`
`15`	`11`
`16`		`-temp=list(adj[cur])`
`17`		`-forvintemp:`
`18`		`-adj[cur].popleft()`
`19`		`-res.append(v)`
`20`		`-ifdfs(v):`
`21`		`-returnres`
`22`		`-res.pop()`
`23`		`-adj[cur].append(v)`
`24`		`-returnFalse`
	`12`	`+defdfs(adj,result,src):`
	`13`	`+ifsrcinadj:`
	`14`	`+destinations=adj[src][:]`
	`15`	`+whiledestinations:`
	`16`	`+dest=destinations[0]`
	`17`	`+adj[src].pop(0)`
	`18`	`+dfs(adj,res,dest)`
	`19`	`+destinations=adj[src][:]`
	`20`	`+res.append(src)`
	`21`	`+`
	`22`	`+dfs(adj,res,"JFK")`
	`23`	`+res.reverse()`
	`24`	`+`
	`25`	`+iflen(res)!=len(tickets)+1:`
	`26`	`+return []`
`25`	`27`
`26`		`-dfs("JFK")`
`27`	`28`	`returnres`

Comments

(0)