Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Fix time limit exceeded error for golang solution in 0332.重新安排行程.md #2924

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
polar9527 wants to merge 1 commit into youngyangyang04:master
base: master
Choose a base branch
Loading
from polar9527:bugfix
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
82 changes: 46 additions & 36 deletions problems/0332.重新安排行程.md
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -477,59 +477,69 @@ class Solution:

### Go
```go
type pair struct {
target string
visited bool
type SortedMap struct {
toes []string // 有序键序列
values map[string]int // 实际键值对
}
type pairs []*pair

func (p pairs) Len() int {
return len(p)
func NewSortedMap() *SortedMap {
return &SortedMap{
toes: []string{},
values: make(map[string]int),
}
}
func (p pairs) Swap(i, j int) {
p[i], p[j] = p[j], p[i]

func (s *SortedMap) Set(to string) {
if _, ok := s.values[to]; !ok {
s.toes = append(s.toes, to)
}
s.values[to]++
}
func (p pairs) Less(i, j int) bool {
return p[i].target < p[j].target

func (s *SortedMap) Sort() {
sort.Sort(sort.StringSlice(s.toes))
return
}

func findItinerary(tickets [][]string) []string {
result := []string{}
// map[出发机场] pair{目的地,是否被访问过}
targets := make(map[string]pairs)
for _, ticket := range tickets {
if targets[ticket[0]] == nil {
targets[ticket[0]] = make(pairs, 0)

targetsMap := make(map[string]*SortedMap)
for _, pair := range tickets {
from, to := pair[0], pair[1]
if _, ok := targetsMap[from]; !ok {
targetsMap[from] = NewSortedMap()
}
targets[ticket[0]] = append(targets[ticket[0]], &pair{target: ticket[1], visited: false})
targetsMap[from].Set(to)
}
for k, _ := range targets {
sort.Sort(targets[k])
for k, _ := range targetsMap {
targetsMap[k].Sort()
}
result = append(result, "JFK")
var backtracking func() bool
backtracking = func() bool {
if len(tickets)+1 == len(result) {

res := []string{"JFK"}
var bt func() bool
bt = func() bool {
if len(res) == len(tickets)+1 {
return true
}
// 取出起飞航班对应的目的地
for _, pair := range targets[result[len(result)-1]] {
if pair.visited == false {
result = append(result, pair.target)
pair.visited = true
if backtracking() {
return true
start := res[len(res)-1]
destinations := targetsMap[start]
if destinations != nil {
for _, to := range destinations.toes {
if destinations.values[to] > 0 {
destinations.values[to]--
res = append(res, to)
if bt() {
return true
}
res = res[:len(res)-1]
destinations.values[to]++
}
result = result[:len(result)-1]
pair.visited = false
}
}
return false
}

backtracking()

return result
bt()
return res
}
```

Expand Down

AltStyle によって変換されたページ (->オリジナル) /