Coding Test

2023.12.02~03 ์ฝ”๋”ฉํ…Œ์ŠคํŠธ

fram 2023. 12. 3. 02:18

๋‘ ์ˆ˜์˜ ๋‚˜๋ˆ—์…ˆ

Int((Double(num1) / Double(num2)) * 1000)

 

์ˆซ์ž ๋น„๊ตํ•˜๊ธฐ

num1 == num2 ? 1 : -1

 

๋ถ„์ˆ˜์˜ ๋ง์…ˆ

    let result1 = (numer1 * denom2) + (numer2 * denom1) //32
    let result2 = (denom1 * denom2) //16
    let gcd = (1...min(result1, result2)).reversed().first { result1 % $0 == 0 && result2 % $0 == 0 } ?? 1
    return [result1/gcd, result2/gcd]

 

๋ฐฐ์—ด ๋‘ ๋ฐฐ ๋งŒ๋“ค๊ธฐ

numbers.map { $0 * 2 }

 

๋‚˜๋จธ์ง€ ๊ตฌํ•˜๊ธฐ

num1 % num2

 

์ค‘์•™๊ฐ’ ๊ตฌํ•˜๊ธฐ

array.sorted()[array.count / 2]

 

์ตœ๋นˆ๊ฐ’ ๊ตฌํ•˜๊ธฐ

    let setArray = NSCountedSet(array: array)
    var maxCount = 0
    var answer = 0
    
    for item in setArray {
        let count = setArray.count(for: item)
        if maxCount < count {
            maxCount = count
            answer = item as! Int
        } else if maxCount == count {
            answer = -1
        }
    }
    
    return answer
let sorted = Dictionary(grouping: array) { $0 }.sorted { $0.value.count > $1.value.count }
return sorted.count > 1 && sorted[0].value.count == sorted[1].value.count ? -1 : sorted[0].key

 

์ง์ˆ˜๋Š” ์‹ซ์–ด์š”

(1...Int(ceil(Double(n)/2.0))).map { $0 * 2 - 1 }

 

๋ง์…ˆ์‹ ์ถœ๋ ฅํ•˜๊ธฐ

let n = readLine()!.components(separatedBy: [" "]).map { Int($0)! }
print("\(n[0]) + \(n[1]) = \(n[0] + n[1])")

 

๋ฌธ์ž์—ด ๋ถ™์—ฌ์„œ ์ถœ๋ ฅํ•˜๊ธฐ

let inp = readLine()!.components(separatedBy: [" "]).map { $0 }
print(inp[0] + inp[1])

 

๋ฌธ์ž์—ด ๋Œ๋ฆฌ๊ธฐ

readLine()!.forEach { print($0) }

 

ํ™€์ง ๊ตฌ๋ถ„ํ•˜๊ธฐ

    let a = Int(readLine()!)!
    print(a % 2 == 0 ? "\(a) is even" : "\(a) is odd")

 

๋ฌธ์ž์—ด ๊ฒน์ณ์“ฐ๊ธฐ

func solution(_ my_string:String, _ overwrite_string:String, _ s:Int) -> String {
    return String(my_string.prefix(s)) + overwrite_string + String(my_string.suffix(my_string.count - (overwrite_string.count + s)))
}

 

๋ฌธ์ž์—ด ์„ž๊ธฐ

func solution(_ str1:String, _ str2:String) -> String {
    let str = Array(str2)
    return str1.enumerated().map { String($0.element) + String(str[$0.offset]) }.joined()
}
return zip(str1, str2).map { String($0) + String($1) }.joined()

 

๋ฌธ์ž ๋ฆฌ์ŠคํŠธ๋ฅผ ๋ฌธ์ž์—ด๋กœ ๋ณ€ํ™˜ํ•˜๊ธฐ

func solution(_ arr:[String]) -> String {
    arr.joined()
}

 

๋ฌธ์ž์—ด ๊ณฑํ•˜๊ธฐ

func solution(_ my_string:String, _ k:Int) -> String {
    String(repeating: my_string, count: k)
}

 

๋” ํฌ๊ฒŒ ํ•ฉ์น˜๊ธฐ

func solution(_ a:Int, _ b:Int) -> Int {
    let result1 = Int(String(a) + String(b)) ?? 0
    let result2 = Int(String(b) + String(a)) ?? 0
    
    return max(result1, result2)
}
    let c = Int("\(a)\(b)")!, d = Int("\(b)\(a)")!
    return c > d ? c : d

 

๋‘ ์ˆ˜์˜ ์—ฐ์‚ฐ๊ฐ’ ๋น„๊ตํ•˜๊ธฐ

func solution(_ a:Int, _ b:Int) -> Int {
    max(Int("\(a)\(b)")!, a * b * 2)
}

 

์œ ํด๋ฆฌ๋“œ ํ˜ธ์ œ๋ฒ• ๊ณต๋ถ€ํ•˜๊ธฐ

String, dictionary ์ •๋ฆฌํ•˜๊ธฐ

 

Pexels์—์„œ Julien BRION๋‹˜์˜ ์‚ฌ์ง„: https://www.pexels.com/ko-kr/photo/102061/