题目来源:https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=117&&tqId=34987&rp=1&ru=/ta/job-code-high&qru=/ta/job-code-high/question-ranking来源:牛客思路:按照斐波那契公式for循环暴力枚举。代码: class Solution { public: int Fibonacci(int n) { if(n==0)return 0; if(n==1...