振兴中华 蓝桥杯初赛

再一次碰见深度优先遍历了，递归的方法很实用，也比较好理解。code #include <stdio.h> int a[4][5] = {{0,1,2,3,4},{1,2,3,4,5},{2,3,4,5,6},{3,4,5,6,7}}; int count = 0; //int num = 0; void find(int x,int y,int num) { if(num == 7) {

>>阅读原文<<