mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
存量题库数据更新
This commit is contained in:
@@ -5,7 +5,7 @@
|
||||
<p>T<sub>0</sub> = 0, T<sub>1</sub> = 1, T<sub>2</sub> = 1, and T<sub>n+3</sub> = T<sub>n</sub> + T<sub>n+1</sub> + T<sub>n+2</sub> for n >= 0.</p>
|
||||
|
||||
|
||||
|
||||
|
||||
<p>Given <code>n</code>, return the value of T<sub>n</sub>.</p>
|
||||
|
||||
|
||||
@@ -15,7 +15,7 @@ T_3 = 0 + 1 + 1 = 2
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
|
||||
|
||||
|
||||
<pre>
|
||||
|
||||
<strong>Input:</strong> n = 4
|
||||
|
Reference in New Issue
Block a user