C++98 非指针解法：求方格图中所有方格好朋友的数量之和

{"title":"C++98 非指针解法：求方格图中所有方格好朋友的数量之和","description":"本代码使用 C++98 非指针方法解决方格图中求所有方格好朋友数量的问题。代码简洁易懂，并提供详细注释，方便理解。","keywords":"C++98, 方格图, 好朋友, 非指针, 算法, 数量之和","content":"#include "iostream"\n#include "vector"\nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n \n vector<vector> grid(n, vector(m));\n\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n cin >> grid[i][j];\n }\n }\n \n int sum = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n // 检查上方\n if (i > 0 && grid[i][j] == grid[i-1][j]) {\n sum++;\n }\n // 检查下方\n if (i < n-1 && grid[i][j] == grid[i+1][j]) {\n sum++;\n }\n // 检查左边\n if (j > 0 && grid[i][j] == grid[i][j-1]) {\n sum++;\n }\n // 检查右边\n if (j < m-1 && grid[i][j] == grid[i][j+1]) {\n sum++;\n }\n }\n }\n \n cout << sum << endl;\n \n return 0;\n}