import Foundation func solution(_ n:Int, _ build_frame:[[Int]]) -> [[Int]] { var answer = Set() func canConstruct() -> Bool { for structure in answer { let x = structure[0], y = structure[1], a = structure[2] // 기둥 if a == 0 { if answer.contains([x - 1, y, 1]) || answer.contains([x, y, 1]) || answer.contains([x, y - 1, 0]) || y == 0 { continue } return false } // 보 else { if answer.contains([x, ..

import Foundation func solution(_ n:Int) -> Int { var answer : Int = n + 1 while true { if n.nonzeroBitCount == answer.nonzeroBitCount { break; } answer += 1 } return answer } n.nonzeroBitcount : 비트에서 1의개수 세준다. import Foundation func solution(_ n:Int) -> Int { let countOne = countBinaryOne(n); for num in n+1...Int.max { if countBinaryOne(num) == countOne { return num; } } return n } func countBi..

import Foundation func solution(_ n:Int, _ lost:[Int], _ reserve:[Int]) -> Int { var lost = lost.sorted(by:

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

import Foundation func solution(_ targets:[[Int]]) -> Int { var targets = targets var e = 0 targets = targets.sorted { ($0[1], $0[0]) = e { res += 1 e = target[1] } } return res } 이차원배열의 정렬은 sorted { ($0[1], $0[0]) < ($1[1], $1[0]) } 개구간으로 쏘지만 폐구간으로도 비교할 수 있었다.

import Foundation func solution(_ n:Int, _ info:[Int]) -> [Int] { var max_diff:Int = 0 var max_lst:[Int] = [] var dfs = [(0,0,0,0,Array(repeating: 0, count:11))] while dfs.count > 0 { let now = dfs.removeLast() let ascore = now.0 let lscore = now.1 let idx = now.2 let cnt = now.3 var lst = now.4 if cnt > n { continue } if idx > 10 { let diff = lscore - ascore if diff > max_diff { lst[10] = n - c..

import Foundation var res = 0 func solution(_ queue1:[Int], _ queue2:[Int]) -> Int { var q1Sum = queue1.reduce(0, +) let q2Sum = queue2.reduce(0, +) let half = (q1Sum + q2Sum) / 2 let qArr = queue1 + queue2 var q1p = 0 var q2p = queue1.count var count = 0 while q2p < qArr.count && q1p half { q1Sum -= qArr[q1p] q1p += 1 } else if q1Sum < half { q1Sum += qArr[q2p] q2p += 1 } else { return count } ..

import Foundation func solution(_ cap:Int, _ n:Int, _ deliveries:[Int], _ pickups:[Int]) -> Int64 { var ans: Int64 = 0 var d = 0 var p = 0 for i in stride(from: n-1, through: 0, by: -1) { d += deliveries[i] p += pickups[i] while d > 0 || p > 0 { d -= cap p -= cap ans += Int64(( i + 1) * 2) } } return ans }

import Foundation func solution(_ users:[[Int]], _ emoticons:[Int]) -> [Int] { var answer = [0, 0] func getAnswer(_ current: [Int]) { if current.count > emoticons.count { return } stride(from: 10, through: 40, by: 10).forEach { getAnswer(current + [$0]) } if current.count < emoticons.count { return } var result = [0, 0] users.forEach { user in var userInfo = [0, 0] for i in current.indices { if ..

import Foundation func solution(_ A: [Int], _ B: [Int]) -> Int { var ans = 0 let a = A.sorted(by: ) for i in 0..