踩木桩过河问题代码

最新推荐文章于 2025-01-16 22:59:04 发布

原创最新推荐文章于 2025-01-16 22:59:04 发布 · 824 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个使用递归算法解决特定跳跃问题的C语言实现。通过分析数组中的数值来决定是否可以完成从当前位置到数组末端的跳跃，并计算最少的跳跃次数。文章详细展示了递归函数的逻辑流程。

#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);
}