Shulou(Shulou.com)06/01 Report--

I would like to share with you how LeetCode solves the problem of the Nth Taibonacci number. I believe most people don't know much about it, so share this article for your reference. I hope you will gain a lot after reading this article. Let's learn about it.

0x01, brief description of the problem

The Taibonacci sequence Tn is defined as follows:

T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn+ Tn+1 + Tn+2 when n > = 0

If I give you an integer n, please return the value of the nth Tibonacci number Tn.

0x02, exampl

Example 1:

Input: n = 4 output: 4 explain: titled 3 = 0 + 1 + 1 = 2T_4 = 1 + 1 + 2 = 4 example 2:

Input: n = 25 output: 1389537

Tip:

0

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.