148. 순서쌍의 개수
import Foundation func solution(_ n:Int) -> Int { var answer : Int = 0 for i in 1...n { if n%i == 0 { answer += 1 } } return answe...
import Foundation func solution(_ n:Int) -> Int { var answer : Int = 0 for i in 1...n { if n%i == 0 { answer += 1 } } return answe...
import Foundation func solution(_ sides:[Int]) -> Int { var answer : Int = 0 var arr : [Int] = [] arr=sides.sorted(by:>) answer = arr[0] < arr[1] + arr[...
import Foundation func solution(_ n:Int) -> Int { var answer : Int = 0 answer = String(n).map{Int(String($0))!}.reduce(0,+) return answer } 자릿수를 더하기위해서 map을 사용해 각각...
import Foundation func solution(_ num_list:[Int]) -> [Int] { var arr : [Int] = [] arr.append(num_list.filter{$0%2 == 0}.count) arr.append(num_list.filter{$0%2 != 0}.co...
import Foundation func solution(_ str1:String, _ str2:String) -> Int { var answer : Int = 0 answer = str1.contains(str2) ? 1 : 2 return answer } 문자열을 포함하는지? 에 ...
import Foundation func solution(_ numbers:[Int]) -> Int { var arr : [Int] = [] var answer : Int = 0 arr = numbers.sorted(by:>) answer = arr[0] * arr[1] ...
import Foundation func solution(_ strlist:[String]) -> [Int] { var answer : [Int] = [] answer = strlist.map{$0.count} return answer } 이전 같았으면 for문을쓰고 막 했을텐데 확...