算法第四版学习笔记二(有趣的递归算法)
摘要:
3、public static int mystery(int a,int b){ if(b == 0) return 0; if(b % 2 == 0) return mystery(a+a, b/2); return mystery(a+a, b/2)+a; } 阅读全文
posted @ 2017-09-29 22:18 战侠歌sy 阅读(201) 评论(0) 推荐(0)
posted @ 2017-09-29 22:18 战侠歌sy 阅读(201) 评论(0) 推荐(0)
posted @ 2017-09-29 16:34 战侠歌sy 阅读(382) 评论(0) 推荐(0)
posted @ 2017-09-27 22:05 战侠歌sy 阅读(266) 评论(0) 推荐(0)
posted @ 2017-09-26 20:19 战侠歌sy 阅读(336) 评论(0) 推荐(0)
posted @ 2017-09-21 10:09 战侠歌sy 阅读(86) 评论(0) 推荐(0)
posted @ 2017-09-21 09:32 战侠歌sy 阅读(632) 评论(1) 推荐(0)