子函数:
int islandPerimeter(int** grid, int gridRowSize, int gridColSize) {
int i, j, k=0;
for (i = 0; i < gridRowSize; i++)
{
//grid[i] = (int*)malloc(sizeof(int) * gridRowSize);有就错了
for (j = 0; j < gridColSize; j++)
{
k += (grid[i][j] == 1)*((!i || !grid[i - 1][j]) + (i == gridRowSize - 1 || !grid[i + 1][j]) + (!j || !grid[i][j - 1]) + (j == gridColSize - 1 || !grid[i][j + 1]));//很巧妙的方式
}
}
return k;
}
主函数:
int main()
{
int m=2, n=2;
int i, j,k;
//scanf("%d,%d", &m, &n);
int **grid=(int**)malloc(sizeof(int*)*m*n);
for (i = 0; i < m; i++)
grid[i] = (int*)malloc(sizeof(int) * m);//二维指针指向二维数组,首先。。。
for (i = 0; i < m; i++)
for (j = 0; j < n; j++)
scanf("%d", &grid[i][j]);//我老是忘记写&&&&&&&&&
k = islandPerimeter(grid, m, n);
printf("%d", k);
system("pause");
return 0;
}