three-fibonacci-sum

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer <code>n</code>.

The Fibonacci sequence starts with 0 and 1, and each subsequent number is the sum of the previous two numbers. Its first few terms are <code>0, 1, 1, 2, 3, 5, 8, 13, ...</code>.

Return <code>true</code> if <code>n</code> can be expressed as the sum of three consecutive terms in the Fibonacci sequence, and <code>false</code> otherwise.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 16

Output: true

Explanation:

The three consecutive terms 3, 5, and 8 have a sum of <code>3 + 5 + 8 = 16</code>.
</div>

Example 2:

<div class="example-block">
Input: n = 8

Output: false

Explanation:

Although <code>1 + 2 + 5 = 8</code>, these terms are not consecutive in the Fibonacci sequence. No three consecutive terms have a sum of 8.
</div>

Example 3:

<div class="example-block">
Input: n = 2

Output: true

Explanation:

The first three terms have a sum of <code>0 + 1 + 1 = 2</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>

第 523 场周赛

weekly-contest-523

threeFibonacciSum

Three Fibonacci Sum

给你一个整数 <code>n</code>。

斐波那契数列&nbsp;以 0 和 1 开始，之后的每个数都是前两个数之和。它的前几项为 <code>0, 1, 1, 2, 3, 5, 8, 13, ...</code>。

如果 <code>n</code> 可以表示为斐波那契数列中&nbsp;连续三项之和，则返回 <code>true</code>；否则返回 <code>false</code>。

&nbsp;

示例 1：

<div class="example-block">
输入： n = 16

输出： true

解释：

连续三项 3、5 和 8 的和为 <code>3 + 5 + 8 = 16</code>。
</div>

示例 2：

<div class="example-block">
输入： n = 8

输出： false

解释：

虽然 <code>1 + 2 + 5 = 8</code>，但这三项在斐波那契数列中并不连续。不存在连续三项的和等于 8。
</div>

示例 3：

<div class="example-block">
输入： n = 2

输出： true

解释：

斐波那契数列的前三项之和为 <code>0 + 1 + 1 = 2</code>。
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>