package cn.oracle;
import org.junit.Test;
/**
* 项目： 斐波那奇数列
*
* @author 丁真
*
*/
/*
* 1：最少两个数。 1 2: 后面的一个数是前面两个数的和。
*
* 顺序 1 2 3 4 5 6 7 8 9 10 11 12 13
* 数值 1 1 2 3 5 8 13 21 34 55 89 144 233 F s l
* F s
*/
public class Demo_Dg {
public static void main(String[] args) {
int n = 3;
int f = 1;
int s = 1;
int last = 0;
int sum = 0;
for (int i = 1; i <= n; i++) {
// TODO Auto-generated method stub
if (i <= 2) {
last = 1;
} else {
last = f + s;
f = s;
s = last;
}
sum = sum + last;
}
System.out.println(last);
System.out.println("前"+"n个数的和为：" + sum);
}
@Test
public void test() {
int n = 4;
int first = 1;
int last = 0;
int sum = 0;
for (int i = 1; i <= n; i++) {
if (i == 1) {
last = 1;
} else {
last = first * 2;
first = last;
}
sum = sum + last;
}
System.out.println("前"+n+"个数的和为：" + sum);
}
}
| 
转播
