import Foundation
func gcd(_ a: Int, _ b: Int) -> Int {
if a % b == 0 {
return b
}
return gcd(b, a % b)
}
func solution(_ denom1:Int, _ numer1:Int, _ denom2:Int, _ numer2:Int) -> [Int] {
var maxDenum = denom1 * numer2 + denom2 * numer1
var maxNum = numer1 * numer2
var gcdValue = gcd(maxDenum, maxNum)
var result = [maxDenum / gcdValue, maxNum / gcdValue]
return result
}
배열 두배 만들기
import Foundation
func solution(_ numbers:[Int]) -> [Int] {
var result: [Int] = []
var a: Int = 0
for number in numbers {
a = number * 2
result.append(a)
}
return result
}