-
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
1 parent
c5c3a07
commit d394305
Showing
5 changed files
with
49 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
Binary file modified
BIN
+1.74 KB
(100%)
...odeproj/project.xcworkspace/xcuserdata/hwangji.xcuserdatad/UserInterfaceState.xcuserstate
Binary file not shown.
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,8 @@ | ||
| // | ||
| // 신고 결과 받기.swift | ||
| // Programmers1 | ||
| // | ||
| // Created by hwangJi on 2022/09/24. | ||
| // | ||
|
|
||
| import Foundation |
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,33 @@ | ||
| // | ||
| // 실패율.swift | ||
| // Programmers1 | ||
| // | ||
| // Created by hwangJi on 2022/10/11. | ||
| // | ||
|
|
||
| import Foundation | ||
|
|
||
| func solution(_ N:Int, _ stages:[Int]) -> [Int] { | ||
| var stageDict: [Int: Int] = [:] | ||
|
|
||
| for i in 1...N { | ||
| stageDict[i] = 0 | ||
| } | ||
|
|
||
| for i in stages { | ||
| stageDict[i] = stageDict[i] != nil ? stageDict[i]! + 1 : 1 | ||
| } | ||
|
|
||
| var stageCount = stages.count | ||
| var failureDict: [Int: Double] = [:] | ||
|
|
||
| for i in stageDict.keys.filter({ $0 <= N }).sorted() { | ||
| failureDict[i] = Double(stageDict[i]!)/Double(stageCount) | ||
| stageCount -= stageDict[i]! | ||
| } | ||
|
|
||
| var sortedDict = failureDict.sorted { $0.key < $1.key } | ||
| sortedDict = sortedDict.sorted { $0.value > $1.value } | ||
|
|
||
| return sortedDict.map { $0.key } | ||
| } |