
递归
_刘小洋
Android开发
展开
-
C语言实现 递归法求最大公约数
#include #include int main(){ int pc(int x,int y); int m,n; scanf("%d %d",&m,&n); printf("%d ",pc(m,n)); return 0;}int pc(int x,int y){ int z; z=x%y; if(z==0)原创 2014-07-16 21:10:01 · 2189 阅读 · 0 评论 -
C语言实现 递归 数字转换成字符串
#include #include int binary_to_ascii(unsigned int value){ unsigned int quotient; quotient = value/10; if( quotient != 0) binary_to_ascii(quotient); putchar ( value % 1原创 2014-07-16 21:16:34 · 840 阅读 · 0 评论 -
C语言实现 递归法 数字转换成字符串
#include #include int binary_to_ascii(unsigned int value){ unsigned int quotient; quotient = value/10; if( quotient != 0) binary_to_ascii(quotient); putchar ( value % 1原创 2014-07-16 21:08:28 · 1007 阅读 · 0 评论 -
HDU 3181 Greatest Naruto Army 递归法
Problem DescriptionWyb is a VERY VERY BIG fans of Naruto(漩涡鸣人). Naruto's perseverance and passion attract him a lot, so does Naruto's skill "Kagebunsin no jyutu"(影分身术). Actually, wyb knows more de原创 2014-07-17 20:00:26 · 510 阅读 · 0 评论 -
JAVA 实现二叉树 递归
public class CreatBiTree {/* * 题目:①用Java代码模拟实现一个二叉树结构②创建该二叉树③遍历该二叉树。 * * 思路:二叉树:一种树状结构,一棵二叉树的“结点”(Node)最多只能拥有2个子结点,也就是度小于或等于2。 * 1)二叉树的结点个数是有限,而且可以没有结点。 * 2)一棵二叉树的树根下可以分为两个子树称为“左子树”(Lef原创 2014-08-02 11:03:41 · 687 阅读 · 0 评论 -
HDU3181 Greatest Naruto Army
Greatest Naruto ArmyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 801 Accepted Submission(s): 522Problem DescriptionWyb is原创 2014-07-18 09:04:25 · 1130 阅读 · 0 评论