/**
 * This function takes a positive integer 'n' as input and returns a list of the first 'n' Fibonacci numbers.
 * Fibonacci numbers are a sequence of numbers in which each number is the sum of the two preceding ones,
 * usually starting with 0 and 1.
 */
fun getFibonacciNumbers(n: Int): List<Int> {

    if (n <= 0) {
        return emptyList()
    } else if (n == 1) {
        return listOf(0)
    } else if (n == 2) {
        return listOf(0, 1)
    } else {
        val fibNums = mutableListOf(0, 1)
        while (fibNums.size < n) {
            fibNums.add(fibNums[fibNums.size - 1] + fibNums[fibNums.size - 2])
        }
        return fibNums
    }
}
/**
 * This function takes a positive integer 'n' as input and returns a list of the first 'n' Fibonacci numbers.
 * Fibonacci numbers are a sequence of numbers in which each number is the sum of the two preceding ones,
 * usually starting with 0 and 1.
 */
fun getFibonacciNumbers(n: Int): List<Int> {
/**
 * This function takes a positive integer 'n' as input and returns a list of the first 'n' Fibonacci numbers.
 * Fibonacci numbers are a sequence of numbers in which each number is the sum of the two preceding ones,
 * usually starting with 0 and 1.
 */
fun getFibonacciNumbers(n: Int): List<Int> {

    if (n <= 0) {
        return emptyList()
    } else if (n == 1) {
        return listOf(0)
    } else if (n == 2) {
        return listOf(0, 1)
    } else {
        val fibNums = mutableListOf(0, 1)
        while (fibNums.size < n) {
            fibNums.add(fibNums[fibNums.size - 1] + fibNums[fibNums.size - 2])
        }
        return fibNums
    }
}