import Foundation func solution(_ 다리길이:Int, _ 무게제한:Int, _ 트럭들무게:[Int]) -> Int { var 진행시간 = 0 var 건너는중: [Int] = [] var 무게제한 = 무게제한 var 트럭들무게 = 트럭들무게 while !(트럭들무게.isEmpty && 건너는중.isEmpty) { 진행시간 += 1 if 다리길이 < 진행시간 { 무게제한 += 건너는중.removeFirst() } if let 첫번째트럭무게 = 트럭들무게.first { if 첫번째트럭무게

import Foundation func solution(_ numbers:[Int64]) -> [Int64] { return numbers.map { number in if number % 2 == 0 { return number + 1 } else { let binary = (~number) & (number + 1) return (number | binary) & ~(binary >> 1) } } }

import Foundation func solution(_ numbers:[Int]) -> [Int] { var stack: [Int] = [] var result: [Int] = Array(repeating: -1, count: numbers.count) for i in 0..

import Foundation func solution(_ word:String) -> Int { var answer = 0 var cases = [781, 156, 31, 6, 1] let words = word.map { char -> Int in switch char { case "A": return 0 case "E": return 1 case "I": return 2 case "O": return 3 default: return 4 } } for word in words { answer += cases.removeFirst() * word + 1 } return answer }

import Foundation func solution(_ arr:[[Int]]) -> [Int] { var zeroCount = 0 var oneCount = 0 func quadCompression(_ row: Int, _ col: Int, _ n: Int) { let target = arr[row][col] for i in row..

import Foundation func solution(_ skill:String, _ skill_trees:[String]) -> Int { func available(_ skill: String, _ tree: String) -> Bool { let alza = tree.filter { skill.contains($0) } return skill.starts(with: alza) } return skill_trees.map { available(skill, $0) }.filter { $0 }.count }

import Foundation func solution(_ dirs:String) -> Int { var x = 0 var y = 0 var result: Set = [] for dir in dirs { switch dir { case "U": if 5 < y + 1 { continue } result.insert("\(x)\(y)UD") y += 1 case "L": if x - 1 < -5 { continue } x -= 1 result.insert("\(x)\(y)LR") case "R": if 5 < x + 1 { continue } result.insert("\(x)\(y)LR") x += 1 default: if y - 1 < -5 { continue } y -= 1 result.insert..

import Foundation func solution(_ land:[[Int]]) -> Int{ var land = land for i in 0..