-
11
说明: 一只青蛙一次可以跳上1级台阶,也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。要求:分别用普通方法和递归方法实现(A frog can jump up a step or two at a time. Find out how many jumping methods the frog can use to jump up an n-step. Requirements: Implemented by common method and recursive method respectively)
- 2019-03-10 16:48:12下载
- 积分:1
-
endotesting
endotesting used to recursive test a important tech tool for QA
- 2007-09-17 19:25:36下载
- 积分:1
-
Search
天气转化,把天气转化成你想要的格式,好好的程序,呵呵(Weather Conversion)
- 2011-05-15 15:04:59下载
- 积分:1
-
Communication
JAVA编程,基于C/S模式的局域网络聊天程序,适用于学生的课程设计(JAVA programming, based on the C/S mode local area network chat program for students in curriculum design)
- 2009-06-14 23:16:28下载
- 积分:1
-
namespace-walkdog
小狗赛跑小游戏,使用java语言编写,walkdog.doc(Dog racing games, using java language, walkdog.doc)
- 2014-04-20 18:40:46下载
- 积分:1
-
severandclient
简单的套接字编程,实现了客户端和服务端,先运行服务端,然后再运行客户端,之后可以相互通信(a simple example of socket)
- 2012-05-28 23:19:52下载
- 积分:1
-
Java进阶篇课设
实现扑克牌,一副牌中抽去大小王剩下52张(如果初练也可只用1~10这40张牌),任意抽取4张牌(称牌组),用加、减、乘、除(可加括号)把牌面上的数算成24。每张牌必须用一次且只能用一次,如抽出的牌是3、8、8、9,那么算式为(9-8)×8×3或3×8+(9-8)或(9- 8÷8)×3等。(In order to realize playing cards, 52 cards are removed from a deck (only 40 cards can be used for the first practice). Four cards are randomly selected (called card groups). The number on the deck is calculated as 24 by adding, subtracting, multiplying and dividing (brackets can be added). Each card must be used once and only once. If the drawn card is 3, 8, 8, 9, the formula is (9-8)*8*3 or 3*8+ (9-8) or (9-8 8)*3)
- 2020-12-31 16:18:59下载
- 积分:1
-
dianzicidian
一个java编写电子词典的课程设计,希望对大家有用(Write a java curriculum design electronic dictionary)
- 2013-11-28 17:25:50下载
- 积分:1
-
permission-denied-stops-watches
Tests that when Geolocation permission is denied, watches are stopped, as well as one-shots.
- 2014-02-05 16:21:24下载
- 积分:1
-
JAVA
使用java语言通过反射创新类的新对象,实现功能(Using java language class through reflection innovative new objects, to achieve functional)
- 2013-06-09 10:30:56下载
- 积分:1