51,397
社区成员




public class FiberNaQiArray {
private static int N = 1000;
public static void main(String[] args) {
long[] a = new long[N];
long start, end;
a[0] = 1;
a[1] = 1;
start = System.currentTimeMillis();
System.out.println(start);
for(int i=2; i<N; i++) {
a[i] = a[i-1] + a[i-2];
}
end = System.currentTimeMillis();
System.out.println(end);
System.out.println("a[" + N + "] = " +a[N-1] + "\tcost:\t" + (end -start) + "ms");
}
}
public class FiberNaQiArray {
private static int N = 40;
public static void main(String[] args) {
// long[] a = new long[N];
long start, end;
// a[0] = 1;
// a[1] = 1;
start = System.currentTimeMillis();
System.out.println(start);
// for(int i=2; i<N; i++) {
// a[i] = a[i-1] + a[i-2];
// }
long result = fibernaqi(N);
end = System.currentTimeMillis();
System.out.println(end);
// System.out.println("a[" + N + "] = " +a[N-1] + "\tcost:\t" + (end -start) + "ms");
System.out.println("a[" + N + "] = " +result + "\tcost:\t" + (end -start) + "ms");
}
public static long fibernaqi(int n) {
if(0 == n || 1 == n) {
return 1;
}
else {
return fibernaqi(n-1) + fibernaqi(n-2);
}
}
}