题解:
class Solution {
public:
int getMaximumGenerated(int n) {
//前两项为0 1
if(n<2){
return n;
}
//定义数组
vector<int> nums(n+1,0);
nums[1] = 1;
int maxnum = 0;
for(int i = 2;i<=n;i++){
nums[i] = i%2==0?nums[i/2]:(nums[i/2]+nums[(i+1)/2]);
maxnum = max(maxnum,nums[i]);
}
return maxnum;
}
};