Three ways to implement Fibonacci sequence in java
Dec 06, 2019 pm 12:00 PMDefinition of Fibonacci sequence: Fibonacci sequence refers to a sequence of 1, 1, 2, 3, 5, 8, 13, 21 , 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368..., this sequence starts from the 3rd item, every Each term is equal to the sum of the previous two terms.
The Fibonacci Sequence, also known as the Golden Section Sequence, was introduced by mathematician Leonardoda Fibonacci using the example of rabbit reproduction, so it is also called the "Rabbit Sequence". Mathematically, the Fibonacci sequence is recursively defined as follows: F(0)=0, F(1)=1, F(n)=F(n-1) F(n-2) ( n>=2, n∈N*).
Free online video tutorial sharing: java online video
Now, we use Java to print the first 10 numbers of the Fibonacci sequence:
The first way: direct assignment method
public class PrintFib { public static void main(String[] args) { //定義第一個加數(shù)a,初始值為1;定義第二個加數(shù)b,初始值為1;定義兩個加數(shù)之和為c,初始值為0 int a = 1; int b = 1; int c = 0; //首先在控制臺打印出數(shù)列中第一個數(shù)和第二個數(shù)的值 System.out.print(a + "\t" + b + "\t"); //建立一個for循環(huán),用于循環(huán)輸出數(shù)列中第三位至第十位的數(shù)字 for (int i = 3; i <= 10; i++) { //第三個數(shù)即為c,a+b等于c的值 c = a + b; //將第一個加數(shù)a賦值為數(shù)列中的第二個數(shù)b的值 a = b; //將第二個加數(shù)b賦值為數(shù)列中的第三個數(shù)c的值 b = c; //在第二次循環(huán)打印時,將打印數(shù)列中的第四個數(shù)為:b + c = b + (a + b) System.out.print(c + "\t"); } } }
This method can also be simplified to:
public class PrintFib { public static void main(String[] args) { int a = 1; int b = 1; for(int i = 1;i <= 5;i++) { //循環(huán)打印a,b兩個數(shù),即兩個兩個打印 System.out.print(a + "\t" + b + "\t"); //打印第三、四個數(shù) a = a + b; b = a + b; } } }
The second way: create and print the array
public class PrintFib { public static void main(String[] args) { //建立一個長度為10的數(shù)組用于存放數(shù)列中的數(shù) int[] arr = new int[10]; //先定義數(shù)列中的第一個和第二個數(shù) arr[0] = 1; arr[1] = 1; //建立一個for循環(huán),打印數(shù)組中的元素 for(int i = 0;i < arr.length;i++) { //判斷:當(dāng)打印第三個數(shù)前,給第三個數(shù)賦值 if(i > 1) { arr[i] = arr[i - 2] + arr[i - 1]; } System.out.print(arr[i] + "\t"); } } }
The third way: calling the function
public class PrintFib { //建立一個函數(shù),用于計算數(shù)列中的每一項 public static int fib(int num) { //判斷:是否是第一個數(shù)和第二個數(shù) if(num == 1 || num == 2) { return 1; }else { //循環(huán)調(diào)用本函數(shù) return fib(num - 2) + fib(num - 1); } } //主函數(shù)(程序入口) public static void main(String[] args) { //建立一個for循環(huán),用于打印第一個至第十個數(shù)字 for(int i = 1;i <= 10;i++) { //調(diào)用函數(shù)進行打印 System.out.print(fib(i) + "\t"); } } }
For more related articles and tutorials, please visit: java introductory learning
The above is the detailed content of Three ways to implement Fibonacci sequence in java. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undress AI Tool
Undress images for free

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

To correctly handle JDBC transactions, you must first turn off the automatic commit mode, then perform multiple operations, and finally commit or rollback according to the results; 1. Call conn.setAutoCommit(false) to start the transaction; 2. Execute multiple SQL operations, such as INSERT and UPDATE; 3. Call conn.commit() if all operations are successful, and call conn.rollback() if an exception occurs to ensure data consistency; at the same time, try-with-resources should be used to manage resources, properly handle exceptions and close connections to avoid connection leakage; in addition, it is recommended to use connection pools and set save points to achieve partial rollback, and keep transactions as short as possible to improve performance.

Use classes in the java.time package to replace the old Date and Calendar classes; 2. Get the current date and time through LocalDate, LocalDateTime and LocalTime; 3. Create a specific date and time using the of() method; 4. Use the plus/minus method to immutably increase and decrease the time; 5. Use ZonedDateTime and ZoneId to process the time zone; 6. Format and parse date strings through DateTimeFormatter; 7. Use Instant to be compatible with the old date types when necessary; date processing in modern Java should give priority to using java.timeAPI, which provides clear, immutable and linear

Pre-formanceTartuptimeMoryusage, Quarkusandmicronautleadduetocompile-Timeprocessingandgraalvsupport, Withquarkusoftenperforminglightbetterine ServerLess scenarios.2.Thyvelopecosyste,

Java's garbage collection (GC) is a mechanism that automatically manages memory, which reduces the risk of memory leakage by reclaiming unreachable objects. 1.GC judges the accessibility of the object from the root object (such as stack variables, active threads, static fields, etc.), and unreachable objects are marked as garbage. 2. Based on the mark-clearing algorithm, mark all reachable objects and clear unmarked objects. 3. Adopt a generational collection strategy: the new generation (Eden, S0, S1) frequently executes MinorGC; the elderly performs less but takes longer to perform MajorGC; Metaspace stores class metadata. 4. JVM provides a variety of GC devices: SerialGC is suitable for small applications; ParallelGC improves throughput; CMS reduces

Networkportsandfirewallsworktogethertoenablecommunicationwhileensuringsecurity.1.Networkportsarevirtualendpointsnumbered0–65535,withwell-knownportslike80(HTTP),443(HTTPS),22(SSH),and25(SMTP)identifyingspecificservices.2.PortsoperateoverTCP(reliable,c

defer is used to perform specified operations before the function returns, such as cleaning resources; parameters are evaluated immediately when defer, and the functions are executed in the order of last-in-first-out (LIFO); 1. Multiple defers are executed in reverse order of declarations; 2. Commonly used for secure cleaning such as file closing; 3. The named return value can be modified; 4. It will be executed even if panic occurs, suitable for recovery; 5. Avoid abuse of defer in loops to prevent resource leakage; correct use can improve code security and readability.

Gradleisthebetterchoiceformostnewprojectsduetoitssuperiorflexibility,performance,andmoderntoolingsupport.1.Gradle’sGroovy/KotlinDSLismoreconciseandexpressivethanMaven’sverboseXML.2.GradleoutperformsMaveninbuildspeedwithincrementalcompilation,buildcac

ExecutorService is suitable for asynchronous execution of independent tasks, such as I/O operations or timing tasks, using thread pool to manage concurrency, submit Runnable or Callable tasks through submit, and obtain results with Future. Pay attention to the risk of unbounded queues and explicitly close the thread pool; 2. The Fork/Join framework is designed for split-and-governance CPU-intensive tasks, based on partitioning and controversy methods and work-stealing algorithms, and realizes recursive splitting of tasks through RecursiveTask or RecursiveAction, which is scheduled and executed by ForkJoinPool. It is suitable for large array summation and sorting scenarios. The split threshold should be set reasonably to avoid overhead; 3. Selection basis: Independent
