腾讯面试

#include<stdio.h>
#include<time.h>
#include<stdlib.h>
int m[99999999],B[99999999];
int T(unsigned int n)  ///递归求解
{
    if(n == 0 || n == 1){
return 1;
}else if(n == 2){
return 2;
}else{
if(n % 2 == 1){
return T((n - 1) / 2);
}else if(n % 2 == 0){
return T(n / 2) + T((n - 2) / 2);
}
}
}


int dp(unsigned int n)   //动态规划求解
{
m[0] = 1;
m[1] = 1;
m[2] = 2;
    if(n == 0 || n == 1){
return 1;
}else if(n == 2){
return 2;
}else{
for(int i = 3;i <= n;i++){
if(i % 2 == 1){
m[i] = m[(i - 1) / 2];
}else{
m[i] = m[i / 2] + m[(i - 2) / 2];
}
}
}
return m[n];
}
int F(unsigned int n)  ///备忘录求解
{
B[n]={-1};
B[0] = 1;
B[1] = 1;
B[2] = 2;
if(B[n] >= 0){
return B[n];
}else{
if(n % 2 == 0){
B[n] = F(n / 2) + F((n - 2) / 2);
}else{
B[n] = F((n - 1) / 2);
}
}
return B[n];
}
int main(void)
{
    clock_t start , finish ;
    int n;
    scanf ("%d",&n);
    start = clock();     ///递归计时
    T(n);
    finish = clock();
    printf("recursion time = %f\n", (double)(finish - start)/CLOCKS_PER_SEC);
    start = clock();    ///动态规划计时
    dp(n);
    finish = clock();
    printf("dp time = %f\n", (double)(finish - start)/CLOCKS_PER_SEC);
    start = clock();    ///备忘录计时
    F(n);
    finish = clock();
    printf("mem time = %f\n", (double)(finish - start)/CLOCKS_PER_SEC);
    return 1;
}