踩木樁過河問題代碼

#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+da

>>阅读原文<<