搜索资源列表
3
- 应用程序中定义方法头如下所示的方法： static int[] add(int[] x, int[] y) static int[] multi(int[] x, int[] y) add方法的功能是：把参数数组x和y（其元素个数相同）的每个元素相加，并作为返回数组的元素；multi方法的功能是：把参数数组x和y（其元素个数相同）的每个元素相乘，并作为返回数组的元素。在Java应用程序中使用这两个方法。 -Write a Java application, perform
Java
- 资料里的是Java的程序代码，有求n个奇数的和，输出给定范围的质数，阶乘的计算，输出前五个被3整除的数，用非递归的方法打印Fibonacci数列。-Data is the Java code, n odd and output demand given the scope of the prime numbers, the factorial calculation output five divisible by 3, non-recursive print the Fibonacci seq
java-classic-algorithm
- java经典算法，包括河内之塔，费式数列，巴斯卡三角形，三色棋，老鼠走迷官，八皇后等25个经典算法，想学习java的朋友不可错过-java classic algorithms, including the Tower of Hanoi, Fibonacci column, Pascal triangle, tri-color chess, mice go 25 fans officer, eight queens classic algorithms friends want to learn
Fibnacci
- 斐波那契数列的实现，得出结果，初期学习java的好案例。-Fibonacci series to achieve, the outcome of the early learning java a good case.
Title
- 题目：古典问题：有一对兔子，从出生后第3个月起每个月都生一对兔子， 小兔子长到第三个月后每个月又生一对兔子，假如兔子都不死， 问每个月的兔子总数为多少？ 这是一个菲波拉契数列问题-Title: Classical problem: There is one pair of rabbits, from the first three months after the birth of every month from birth to a pair of rabbits, bunni
Desktop
- 乘法口诀，最大公约数，2/1+3/2+....,Fibonacci数列,1000以内的水仙花数-Multiplication formulas, the common denominator, 2/1+3/2+ ...., Fibonacci series, 1000 within a few daffodils
feibonaqishulie
- 求出1000以内的斐波那契数的java小程序-Obtained within the 1000 Fibonacci numbers java applet
Fib
- 在网页上输出斐波那契前40位数字，第一位与后一位的比值-On the front page output Fibonacci Fibonacci 40 digits, the first and after a ratio
fibonacciSeries
- The Fibonacci Sequence is the series of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... The next number is found by adding up the two numbers before it. The 2 is found by adding the two numbers before it (1+1) Similarly, the 3 is found
javaProgram
- 通过使用JAVA程序，我们将学习Fibonacci序列，并在100中计算素数。-Through the use of the JAVA program, we will learn of Fibonacci sequence and calculate of prime Numbers within 100.
structure
- 集合各种算法、排序、二叉树的简单例子，基础知识！(structure BinaryTree Fibonacci)
Fibonacci
- 用if（）else()语句非递归实现的裴波那契数列(The non recursion of the if () else () statement of the Pei Bo () code)
Force_ScalpRO_EA
- 采用斐波那契回调线算法自动下单,移动止损,内部增设新闻过滤波,可以设置周一到周五交易时间段,适合欧元兑美元15分钟图,绝对暴力(Using Fibonacci callback line algorithm to automatically place orders, move stops, and add news filtering wave inside, you can set trading time from Monday to Friday, which is suitable f