LeetSolve
Published in

LeetSolve

How I Solve Leetcode 509. Fibonacci Number

A simple example of dynamic programming

Problem statement

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

F(0) = 0, F(1) = 1
F(n) = F(n — 1) + F(n — 2), for n > 1.

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Nhut Nguyen

Nhut Nguyen

Storyteller. I write code, instructions and stories.