package Others;import java.util.Scanner;/*** Fibonacci sequence, and characterized by the fact that every number* after the first two is the sum of the two preceding ones.* <p>* Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21,...* <p>* Source for the explanation: https://en.wikipedia.org/wiki/Fibonacci_number*/public class FibToN {public static void main(String[] args) {//take inputScanner scn = new Scanner(System.in);int N = scn.nextInt();// print all Fibonacci numbers that are smaller than your given input Nint first = 0, second = 1;scn.close();while (first <= N) {//print first fibo 0 then add second fibo into it while updating second as wellSystem.out.println(first);int next = first + second;first = second;second = next;}}}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。