프로그래머스/Lv.0
프로그래머스 코딩테스트 연습 Lv.0 Swift
-
import Foundation func solution(_ s:String) -> Int { var stack = [Int]() for str in s.components(separatedBy: " ") { if str == "Z" { stack.popLast() } else { stack.append(Int(str)!) } } return stack.reduce(0, +) }
[Swift] 컨트롤 제트import Foundation func solution(_ s:String) -> Int { var stack = [Int]() for str in s.components(separatedBy: " ") { if str == "Z" { stack.popLast() } else { stack.append(Int(str)!) } } return stack.reduce(0, +) }
2023.02.08 -
import Foundation func solution(_ keyinput:[String], _ board:[Int]) -> [Int] { let board = board.map { $0 / 2 } var x = 0 var y = 0 for input in keyinput { switch input { case "right": x += 1 if x > board[0] { x = board[0] } case "left": x -= 1 if abs(x) > board[0] { x = -board[0] } case "up": y += 1 if y > board[1] { y = board[1] } case "down": y -= 1 if abs(y) > board[1] { y = -board[1] } defa..
[Swift] 캐릭터의 좌표import Foundation func solution(_ keyinput:[String], _ board:[Int]) -> [Int] { let board = board.map { $0 / 2 } var x = 0 var y = 0 for input in keyinput { switch input { case "right": x += 1 if x > board[0] { x = board[0] } case "left": x -= 1 if abs(x) > board[0] { x = -board[0] } case "up": y += 1 if y > board[1] { y = board[1] } case "down": y -= 1 if abs(y) > board[1] { y = -board[1] } defa..
2023.02.08 -
import Foundation func solution(_ chicken:Int) -> Int { var result = 0 var coupon = chicken while coupon >= 10 { result += coupon / 10 coupon = coupon / 10 + coupon % 10 } return result }
[Swift] 치킨 쿠폰import Foundation func solution(_ chicken:Int) -> Int { var result = 0 var coupon = chicken while coupon >= 10 { result += coupon / 10 coupon = coupon / 10 + coupon % 10 } return result }
2023.02.08 -
import Foundation func solution(_ array:[Int]) -> Int { let result = Set(array).map { num in (num: num, count: array.filter { $0 == num }.count) }.sorted { $0.count > $1.count } return result.count > 1 && result[0].count == result[1].count ? -1 : result[0].num }
[Swift] 최빈값 구하기import Foundation func solution(_ array:[Int]) -> Int { let result = Set(array).map { num in (num: num, count: array.filter { $0 == num }.count) }.sorted { $0.count > $1.count } return result.count > 1 && result[0].count == result[1].count ? -1 : result[0].num }
2023.02.08 -
import Foundation func solution(_ numbers:[Int]) -> Int { let numbers = numbers.sorted() return max(numbers[0] * numbers[1], numbers[numbers.count - 2] * numbers[numbers.count - 1]) }
[Swift] 최댓값 만들기(2)import Foundation func solution(_ numbers:[Int]) -> Int { let numbers = numbers.sorted() return max(numbers[0] * numbers[1], numbers[numbers.count - 2] * numbers[numbers.count - 1]) }
2023.02.07 -
import Foundation func solution(_ numbers:[Int]) -> Int { let arr = numbers.sorted(by: >) return arr[0] * arr[1] }
[Swift] 최댓값 만들기(1)import Foundation func solution(_ numbers:[Int]) -> Int { let arr = numbers.sorted(by: >) return arr[0] * arr[1] }
2023.02.07 -
import Foundation func solution(_ n:Int) -> Int { return (0...n).filter { $0 % 2 == 0 }.reduce(0, +) }
[Swift] 짝수의 합import Foundation func solution(_ n:Int) -> Int { return (0...n).filter { $0 % 2 == 0 }.reduce(0, +) }
2023.02.07 -
import Foundation func solution(_ n:Int) -> [Int] { return (0...n).filter{ $0 % 2 != 0 } }
[Swift] 짝수는 싫어요import Foundation func solution(_ n:Int) -> [Int] { return (0...n).filter{ $0 % 2 != 0 } }
2023.02.07