請用long (64-bit)長整數格式計算費氏數列(Fibonacci sequence)到overflow
f[0]=1, f[1]=1
f[n]=f[n-1]+f[n-2] 當n>=2
強烈建議不要用遞迴方法。
提示：參閱Java計算Fibonacci數列存到陣列
herrDeng網內搜尋
自訂搜尋
熱門文章
-
教育部為提昇全民資安素養與電腦防護能力，本部於101年9月5日至11月5日舉辦「全民資安素養自我評量」活動，請在活動期間內踴躍上網檢測資訊安全素養認知程度，並有機會參與抽獎，詳情請參閱活動網站（網址： https://isafe.moe.edu.tw/event
-
先說明一下這是後知後覺的解答，所謂後知就是股票價格已知存在陣列(清單)，當然就要用迴圈練習，雙迴圈暴力解需時O(n**2)，當然不用，採python單一迴圈解答「最佳股票的買賣時機#LeetCode 121 Best Time to Buy and Sell Stock」，解...
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
你會用C的算子sizeof?
-
Python C++使用字串find迴圈速解Leetcode 2490 Circular Sentence C++ & Python都有字串的find，用法都類似 split=s.find(' ', split+1)能找到s從index=split+1開...
-
Python CPP heap priority queue速解L eetcode 2530. Maximal Score After Applying K Operations heap/priority queue是重要的資料結構，無論是C++的std::priority_q...
53 則留言:
(1)程式碼
package java0922;
public class test3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2 ; i<f.length ;i++ ){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
(2) 最後的數字是91
package hibon;
public class ex2 {
public static void main(String[] args) {
long f[]=new long[100];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class test3 {
public static void main(String[] args)
{
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i<f.length;i++)
{
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
最大數值:7540113804746346429
package p1;
public class hw3 {
public static void main(String[] args) {
long f[]=new long [92];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
package p1;
public class hw3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
package sm;
public class www {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
package hw1;
public class exx {
public static void main(String[] args)
{
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i<f.length;i++)
{
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class hw1 {
public static void main(String[] args) {
// TODO Auto-generated method stub
long f[]=new long[100];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class ex2 {
public static void main(String[] args) {
// TODO Auto-generated method stub
long f[]=new long[100];
f[0]=f[1]=1;
for(int i=2;i<f.length;i++)
{
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
package p1;
public class HW3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2 ; i<f.length ; i++ ){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
最高92
package hw1;
public class p3 {
public static void main(String[] args)
{
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2 ; i<f.length ; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
package p1;
public class w3 {
public static void main(String[] args) {
long f[]=new long[100];
f[0]=f[1]=1;
for(int i=2;i<f.length;i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class FIBONACCI {
public static void main(String[] args) {
// TODO Auto-generated method stub
long f[]=new long[100];
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class p3
{
public static void main(String[] args)
{
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i<f.length;i++)
{
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class Fibonacci {
public static void main(String[] args) {
long f[]= new long[101];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println (i+"--->"+f[i]);
}
}
}
package p1;
public class Fibonacci {
public static void main(String[]args){
long f[]=new long[100];
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class dd {
public static void main(String[] args) {
long f[]=new long [92];
f[0]=f[1]=1;
for(int i=2 ; i<f.length ; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
public class dd {
public static void main(String[] args) {
long f[]=new long [92];
f[0]=f[1]=1;
for(int i=2 ; i<f.length ; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
public class EX3 {
public static void main(String[] args) {
{
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i<f .length ; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
}
public class ex1 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i<f.length;i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class ew {
public static void main(String[] args) {
// TODO Auto-generated method stub
long f[]=new long [101];
for(int i=2;i<f.length;i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
package p1;
public class Fibonacci {
public static void main(String[]args){
long f[]=new long[100];
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class hw3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2 ; i<f.length ;i++ ){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
package p1;
public class hw3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2 ; i<f.length ; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
package P1;
public class hw3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
package hw1;
public class Fibonacci {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i"+f[i]);
}
}
}
public class Fibonacci {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
public class GGG {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i"+f[i]);
}
}
}
public class Fibonacci {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
package hew1;
public class pack5556 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2 ; i<f.length ;i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
package a1;
public class aa {
public static void main(String[] args) {
long f[]=new long[100];
f[0]=f[1]=1;
for(int i=2;i<f.length;i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
package ppp;
public class hw3 {
public static void main(String[] args) {
// TODO Auto-generated method stub
long f[]=new long[92];
f[0]=f[1]=1;
for (int i=2;i<f.length;i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
package p1;
public class hw3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2 ; i<f.length ; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
package p1;
public class hw3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2 ; i<f.length ;i++ ){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
public class fibonacci {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
public class hw3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i<f.length;i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class 費氏數列 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i<f.length;i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class Fibonacci {
public static void main(String[] args) {
long f[]=new long[101];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class fibonacci {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
package hw;
public class hw1 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i<f.length;i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
package hw1;
public class p3 {
public static void main(String[] args) {
// TODO Auto-generated method stub
long f[]=new long[92];
f[0]=f[1]=1;
for (int i=2;i<f.length ;i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
public class Fibonacci {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
public class hw3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
package p1;
public class H3 {
public static void main(String[] args) {
long f[]=new long [92];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
public class Fibonacci {
public static void main(String[] args) {
long f[]=new long [92];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);
}
}
}
package www;
public class asd {
public static void main(String[] args) {
long f []=new long [92];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++)
{
f[i]=f[i-1]+f[i-2];
System.out.println(i+"--->"+f[i]);// TODO Auto-generated method stub
}
}
}
public class Fibonacci {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i<f.length; i++){
f[i]=f[i-1]+f[i-2];
System.out.println(i+"=>"+f[i]);
}
}
}
public class P3
{
public static void main(String[] args)
{
// TODO Auto-generated method stub
long f []=new long [92];
f[0]=f[1]=1;
for(int i=2; i"+f[1]);
}
}
}
public class P3
{
public static void main(String[] args)
{
// TODO Auto-generated method stub
long f []=new long [92];
f[0]=f[1]=1;
for(int i=2; i"+f[1]);
}
}
}
public class P3
{
public static void main(String[] args)
{
// TODO Auto-generated method stub
long f []=new long [92];
f[0]=f[1]=1;
for(int i=2; i"+f[1]);
}
}
}
package b10333093;
public class ex2 {
public static void main(String[] args) {long f[]=new long[100];f[0]=f[1]=1;for(int i=2; i<f.length; i++){f[i]=f[i-1]+f[i-2];System.out.println(i+"--->"+f[i]);}
}
}
package p1;
public class hw3 {
public static void main(String[] args) {
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2; i"+f[i]);
}
}
}
public class test4 {
public static void main(String[] args)
{
long f[]=new long[92];
f[0]=f[1]=1;
for(int i=2;i"+f[i]);
}
}
}
張貼留言