69,370
社区成员
发帖
与我相关
我的任务
分享
switch (i)
{
case 1:
i = 2;
break;
case 2:
i = 1;
break;
default:
break;
}
int func(int n)
{
int pre = 0;
int cur = 1;
int result = pre + cur;
if (n < 0)
return 0;
while (n-- > 2)
{
pre = cur;
cur = result;
result = pre + cur;
}
return result;
}
for (int i = 1; i <= n; i++)
{
保存下a[n-1] 及 a[n-2]的值
}
for (int i = n; i <= m; i++)
{
带入其值计算a[n]
更新a[n-1] a[n-2]的值
}
int a(int n){
int j = 0;
int k = 1;
res = 0;
for(int i=2;i<n;i++){
res = j + k;
j = k;
k = res;
}
if(n == 0) return j;
if(n == 1) return k;
return res;
}
switch (i == 1 ? (i = 2) : (i == 2 ? (i = 1) : (i)))
{
}