51 lines
1.7 KiB
Kotlin
51 lines
1.7 KiB
Kotlin
/*
|
|
* MIT License
|
|
*
|
|
* Copyright (c) 2019 norangebit
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
* in the Software without restriction, including without limitation the rights
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in all
|
|
* copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
* SOFTWARE.
|
|
*
|
|
*/
|
|
|
|
package it.norangeb.algorithms.exercises
|
|
|
|
import arrow.core.None
|
|
import arrow.core.Option
|
|
import it.norangeb.algorithms.datastructures.queue.priority.BinaryHeap
|
|
|
|
class KMin<T : Comparable<T>>(private val k: Int) {
|
|
private val heap = BinaryHeap.createMaxPriorityQueue<T>()
|
|
|
|
fun insert(elem: T): Option<T> {
|
|
heap.peek().fold(
|
|
{ heap.insert(elem) },
|
|
{
|
|
if (elem < it || heap.size() < k)
|
|
heap.insert(elem)
|
|
})
|
|
|
|
if (heap.size() > k)
|
|
heap.pop()
|
|
|
|
if (heap.size() < k)
|
|
return None
|
|
|
|
return heap.peek()
|
|
}
|
|
} |