题目:请编写一个类,这个类需要有一个正整数的私有属性,并且有一个公有方法能够求出并打印属性值所斐波那契数列对应的项目,比如这个类的整数属性为n,则该方法需更找出斐波那契数列的n项。需要编写主函数验证。(斐波那契数列为f1=1
,f2=1,f3=2,fn=fn-1+fn+1
#include <iostream>
using namespace std;
class A
{
private:
int n;
public:
A(int x) { n = x; }
void print()
{
int a = 1;
int b = 1;
for (int i = 0; i < n; i++)
{
cout << a << endl;
b = b + a;
a = b - a;
}
}
};
int main()
{
A a(10);
a.print();
return 0;
}
#include <stdio.h>
#include <vector>
using std::vector;
class Fibonacci{
public:
Fibonacci(int cnt):n(cnt){}
void print(){
if (n <= 2)
{
if(n == 1){
printf("1\n");
}
else{
printf("1 1\n");
}
}
arr.push_back(1);
arr.push_back(1);
int a = 1;
int b = 1;
int c = 1;
for (int i = 3; i <= n; i++)
{
a = b;
b = c;
c = a + b;
arr.push_back(c);
}
for(int i = 0; i < arr.size(); i++){
printf("%d ", arr[i]);
}
printf("\n");
}
private:
vector<int> arr;
int n;
};
int main(){
Fibonacci fibon(6);
fibon.print();
return 0;
}