fibonnaci.txt

来自「java的一经典教程」· 文本 代码 · 共 36 行

// Program to compute the n th term in the Fibonnaci series
// where n is entered by the user

import javax.swing.JOptionPane;

public class Fibonnaci
{

   public static void main(String[] args)
   {
      int lastTerm = 1;
      int thisTerm = 1;
      int nextTerm;
      int termNumber = 2;

      String numStr;

      numStr = JOptionPane.showInputDialog(
         "Which term would you like? " );
      int n = Integer.parseInt(numStr);

      while (termNumber < n)
      {
 	     nextTerm = lastTerm + thisTerm;
 	     lastTerm = thisTerm;
 	     thisTerm = nextTerm;
 	     termNumber++;
      }

      JOptionPane.showMessageDialog(null, "term " + n +
         " is " + thisTerm);

      System.exit(0);
   }
}