代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/157086/11740200
class recursion.class
www.eeworm.com/read/157086/11740236
java recursion.java
class Factorial{
int fact(int n){
int result;
if(n==1) return 1;
result=fact(n-1)*n;
return result;
}
}
class Recursion{
public static void main(String args[]){
Factorial f=new Factorial();
www.eeworm.com/read/253821/12184249
c recursion.c
/* 递归法将整数转换成字符 */
# include
void convert(int n)
{
int i;
if((i=n/10) != 0)
convert(i);
putchar(n%10+'0');
}
void main()
{
int number;
printf("输入整数：");
scanf("%d", &n
www.eeworm.com/read/338034/12327438
c recursion.c
/* 递归法将整数转换成字符 */
# include
void convert(int n)
{
int i;
if((i=n/10) != 0)
convert(i);
putchar(n%10+'0');
}
void main()
{
int number;
printf("输入整数：");
scanf("%d", &n
www.eeworm.com/read/127981/14322948
java recursion.java
// recursion.Java
public class recursion
{
static long function(int n)
{
if(n==1)
return 1;
else
return n*function(n-1);
}
pub
www.eeworm.com/read/126308/14433595
c recursion.c
/* 递归法将整数转换成字符 */
# include
void convert(int n)
{
int i;
if((i=n/10) != 0)
convert(i);
putchar(n%10+'0');
}
void main()
{
int number;
printf("输入整数：");
scanf("%d", &n
www.eeworm.com/read/115116/15026014
c recursion.c
/* 递归法将整数转换成字符 */
# include
void convert(int n)
{
int i;
if((i=n/10) != 0)
convert(i);
putchar(n%10+'0');
}
void main()
{
int number;
printf("输入整数：");
scanf("%d", &n
www.eeworm.com/read/114127/15075782