func solution(_ n:Int, _ m:Int) -> [Int] { var N = n var M = m var arr : [Int] = [] var gcd : Int = 0 var lcm : Int = 0 var temp : Int = 0 if N < M { ...

import Foundation let n = readLine()!.components(separatedBy: [" "]).map { Int($0)! } let (a, b) = (n[0], n[1]) var row = Array(repeating: "*",count:a).joined() for i in 0..<b { print...

func solution(_ arr1:[[Int]], _ arr2:[[Int]]) -> [[Int]] { var answer : [[Int]] = [] answer = zip(arr1,arr2).map{zip($0,$1).map{$0+$1}} return answer } zip을 사용해보려...

func solution(_ s:String) -> Bool { var answer : Bool = true answer = s.count == 4 || s.count == 6 ? (s.map{$0.isNumber}.contains(false) ? false : true) : false ...

import Foundation func solution(_ price:Int, _ money:Int, _ count:Int) -> Int64{ var answer:Int64 = -1 var Price : Int = 0 Price = (1...count).map{$0}.reduce(0, +) * p...

func solution(_ s:String) -> String { var string : String = "" string = s.map{String($0)}.sorted(by:>).joined() return string } 배열로 변환하여 내림차순으로 한뒤 다시 join으로 하면서 ...

import Foundation func solution(_ left:Int, _ right:Int) -> Int { var n : Int = 0 var num : Int = 0 var answer : Int = 0 for i in left ... right { n = 1 ...

import Foundation func solution(_ a:[Int], _ b:[Int]) -> Int { var answer : Int = 0 for i in a.indices{ answer += a[i]*b[i] } return answer } for문을 사용해서 해결했는...

func solution(_ n:Int) -> String { var answer : String = "" var sent : String = "" sent = String(repeating: "수박", count:5000) answer = String(sent.prefix(n)) ...

func solution(_ s:String) -> String { var answer : String = "" var S : String = "" var n : Int = 0 S = s n = S.count answer = n % 2 == 0 ? String(S[String.Index(enc...