0405

Author: co3oing

.DS_Store

@@ -0,0 +1,24 @@
+func solution(_ strings:[String], _ n:Int) -> [String] {
+    var strings = strings.sorted()
+    var dic: [String : String] = [:]
+    var answer: [String] = []
+    
+    for (i, str) in strings.enumerated() {
+        let value = "\(str[str.index(str.startIndex, offsetBy: n)])"
+        dic.updateValue(str, forKey: "\(value)\(i)")
+    }
+    
+    
+    let keys = Array(dic.keys).sorted()
+    
+    print(dic)
+    print(keys)
+
+
+    for key in keys {
+        answer.append(dic[key]!)
+    }
+    
+    
+    return answer
+}

문자 내 마음대로 정렬하기.swift

@@ -0,0 +1,31 @@
+import Foundation
+
+func solution(_ answers:[Int]) -> [Int] {
+    var person1 = [1, 2, 3, 4, 5]
+    var person2 = [2, 1, 2, 3, 2, 4, 2, 5]
+    var person3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5]
+    var score = [0, 0, 0]
+    var answer: [Int] = []
+    
+    for i in 0..<answers.count {
+        if answers[i] == person1[i % 5] {
+            score[0] += 1
+        }
+        if answers[i] == person2[i % 8] {
+            score[1] += 1
+        }
+        if answers[i] == person3[i % 10] {
+            score[2] += 1
+        }
+    }
+    
+    let max = score.max()!
+    
+    for i in 0..<score.count {
+        if score[i] == max {
+            answer.append(i + 1)
+        }
+    }
+    
+    return answer
+}

완전탐색/모의고사.swift

@@ -0,0 +1,13 @@
+import Foundation
+
+func solution(_ array:[Int], _ commands:[[Int]]) -> [Int] {
+    var answer: [Int] = []
+    
+    for cmd in commands {
+        let range: ClosedRange = (cmd[0] - 1)...(cmd[1] - 1)
+        let sortedArr = array[range].sorted()
+        answer.append(sortedArr[cmd[2] - 1])
+    }
+
+    return answer
+}

정렬/K번째 수.swift

@@ -0,0 +1,27 @@
+import Foundation
+
+func solution(_ n:Int, _ lost:[Int], _ reserve:[Int]) -> Int {
+    var possible = Array(repeating: 1, count: n)
+    var answer = 0
+    
+    for i in lost { possible[i - 1] -= 1 }
+    for i in reserve { possible[i - 1] += 1 }
+    
+    for i in 0..<n {
+        if i != 0 && possible[i - 1] == 2 && possible[i] == 0 {
+            possible[i - 1] = 1
+            possible[i] = 1
+        } else if i != n - 1 && possible[i] == 0 && possible[i + 1] == 2 {
+            possible[i] = 1
+            possible[i + 1] = 1
+        }
+    }
+    
+    for i in 0..<n {
+        if possible[i] != 0 {
+            answer += 1
+        }
+    }
+
+    return answer
+}