题目:计算出与第二行第一列的元素5相邻的有几个5.相邻的相邻也算相邻元素。
1 1 5 5 1
5 5 5 1 1
1 1 5 5 1
1 1 5 1 1
5 1 1 1 5
#include "stdio.h"
int p[5][5]=
{
{1,1,5,5,1},
{5,5,5,1,1},
{1,1,5,5,1},
{1,1,5,1,1},
{5,1,1,1,5}
};
int q[5][5]=
{
{0,0,0,0,0},
{0,0,0,0,0},
{0,0,0,0,0},
{0,0,0,0,0},
{0,0,0,0,0}
};
int isvalid(int i,int j)
{
if(i<0 || i>4 || j<0 || j>4)
return 0;
if(q[i][j] == 1)
return 0;
return 1;
}
void adjacentNumber(int i,int j,int k,int *s)
{
int a;
q[i][j] = 1;
if(isvalid(i-1,j)) /*从p[i][j]的上方元素深度搜索*/
{
if(p[i-1][j] ==