-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
39 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,35 @@ | ||
| // | ||
| // 순위.swift | ||
| // AlgorithmReview | ||
| // | ||
| // Created by 박소윤 on 2023/10/19. | ||
| // | ||
|
|
||
| import Foundation | ||
|
|
||
| func timeout(_ n:Int, _ results:[[Int]]) -> Int { | ||
|
|
||
| func forGrade(_ nodes: [Int]) { | ||
| let canGrade = nodes.count + lose[nodes.last!].count == n | ||
| for i in lose[nodes.last!] { | ||
| forGrade(nodes + [i]) | ||
| } | ||
| if canGrade { | ||
| ans = max(ans, nodes.count) | ||
| } | ||
| } | ||
|
|
||
| var lose = [[Int]](repeating: [], count: n) | ||
| var canStart = [Bool](repeating: true, count: n) | ||
| for i in results { | ||
| lose[i[1]-1].append(i[0]-1) | ||
| canStart[i[0]-1] = false | ||
| } | ||
|
|
||
| var ans = 0 | ||
| let startIdx = canStart.firstIndex(of: true) | ||
| if startIdx != nil { | ||
| forGrade([startIdx!]) | ||
| } | ||
| return ans | ||
| } |