题目描述：输入n个整数，找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字，则最小的4个数字是1,2,3,4,。import Foundation class For30Solution { func topK(_ n: [Int],_ minK: Int) -> [Int] { if n.count == 0 || mi...
