kotlin 尾递归_Kotlin程序使用递归进行十进制到二进制转换

kotlin 尾递归

Given a decimal number, we have to convert it into binary using recursion.

给定一个十进制数字，我们必须使用递归将其转换为二进制。

Example:

例：

    Input:
    num = 113

    Output:
    1110001

在Kotlin中使用递归进行十进制到二进制转换的程序 (Program for Decimal to Binary conversion using recursion in Kotlin)

package com.includehelp.basic

import java.util.*

/* function to convert given decimal into Binary */
fun binaryRecursion(_decimalNumber: Long): String {
    var decimalNumber = _decimalNumber
    if (decimalNumber > 0) {
        val a: Long = decimalNumber % 2
        decimalNumber /= 2
        return a.toString() + binaryRecursion(decimalNumber)
    }
    return ""
}

//Main function Entry Point of Program
fun main(arg: Array<String>) {
        //Input Stream
    val sc = Scanner(System.`in`)

    //Input Integer Number
    println("Enter Decimal Number  : ")
    var decimal: Long = sc.nextLong()

    val binary= binaryRecursion(decimal).reversed()
    println("Binary of $decimal using Recursion : $binary")
}

Output

输出量

Run 1:
Enter Decimal Number  :
45
Binary of 45 using Recursion : 101101
-----
Run 2:
Enter Decimal Number  :
113
Binary of 113 using Recursion : 1110001

翻译自: https://www.includehelp.com/kotlin/decimal-to-binary-conversion-using-recursion.aspx

kotlin 尾递归