- Published on
K dan kichik elementlar ichida maksimum
- Authors
- Name
- ShoxruxC
- @iOSdasturchi
๐ Vazifa tavsifi
N ta son va K berilgan. K dan kichik elementlar ichidan eng kattasini toping. Bo'lmasa 0.
Misol:
Input: N=6, K=10, nums=[3, 15, 7, 20, 5, 12]
Output: 7
K dan kichik elementlar ichida maksimum
O'rta8 daqiqa10 ball
๐ Misollar
Kiruvchi: N=6, K=10, nums=[3, 15, 7, 20, 5, 12]
Chiquvchi: 7
Kiruvchi: N=5, K=5, nums=[1, 2, 3, 4, 6]
Chiquvchi: 4
func maxLessThanK(_ N: Int, _ K: Int, _ nums: [Int]) -> Int {
// Kodingizni shu yerga yozing
}
Run tugmasini bosing