c*w
1 楼
小印问的。给个下面的route， 然后input：string source, string destination.
打印出所有的可能路线。example, source=NY, dest=LA; return NY->LA, NY->DC->LA
, NY->Chicago->DC->LA. 先讨论下怎么存下面数据。我说用个
Map> routes; 然后想写个递归，最后没写完
source destination
NY DC
DC LA
NY LA
Chicago DC
LA NY
NY Chicago
.......
打印出所有的可能路线。example, source=NY, dest=LA; return NY->LA, NY->DC->LA
, NY->Chicago->DC->LA. 先讨论下怎么存下面数据。我说用个
Map
source destination
NY DC
DC LA
NY LA
Chicago DC
LA NY
NY Chicago
.......
