题解 | #计算斐波那契数最小差值#C++暴力循环遍历解法
计算斐波那契数最小差值
https://www.nowcoder.com/practice/743de16bf29041b7b423609628a1fa8c
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n=0;
cin>>n;
int a=0;
int b=1;
int c=a+b;
int ans=n;
while(n-c>=0)
{
ans=min(ans,n-c);
a=b;
b=c;
c=a+b;
}
ans=min(c-n,ans);
cout<<ans;
return 0;
}
