踩木桩过河问题代码

#include<stdio.h>
int  jump(int *data, int n, int i)
{
int num = 0;
int num1 = -1;
int num2 = -1;
if(data[i] == 0) return num =-1;
if(data[i] > (n-i-1)) return num = 1;
else 
{
num1 = jump(data,n,i+data[i]);
if(i+1-data[i] > 0)
num2 = jump(data,n,i-data[i]);
printf("num1 = %d, num2 = %d\n",num1,num2);


if((num1 ==  -1) && (num2 == -1)) {printf("aaaaaaaaaaa\n");num=-1;}
else 
if(num1 ==  -1) {num =  num2 +1; printf("aaaaaaaaaaa\n");}
else 
if(num2 == -1 ) {num =  num1 +1;printf("aaaaaaaaaaa\n");}
else {num =  1+(num1<num2?num1:num2);printf("aaaaaaaaaaa\n");}
}


printf("num = %d\n",num);
return num;
} 
int main()
{
int  data[100];
int n;
int i;


scanf("%d",&n);
for(i = 0;i<n-1;i++)
{
scanf("%d ",&(data[i]));
}


scanf("%d",&(data[i]));
int result = jump(data,n,0);
printf("%d\n",result);
}