Leetcode Problem 509. Fibonacci Number

509. Fibonacci Number

Leetcode Solutions

Check if n is 0 or 1, return n as it is the base case.
Initialize two variables, prev1 and prev2, to represent the last two Fibonacci numbers. Initially, prev1 is set to 1 and prev2 to 0.
Loop from 2 to n, and for each iteration: a. Calculate the current Fibonacci number as the sum of prev1 and prev2. b. Update prev2 to the value of prev1. c. Update prev1 to the value of the current Fibonacci number.
After the loop ends, return prev1 which now holds the value of F(n).

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen