Update Solution2.cpp

Author: yanglbme

solution/0200-0299/0200.Number of Islands/Solution2.cpp

@@ -5,7 +5,7 @@ class Solution {
         int n = grid[0].size();
         int ans = 0;
         int dirs[5] = {-1, 0, 1, 0, -1};
-        function<void(int, int)> bfs = [&](int i, int j) {
+        auto bfs = [&](int i, int j) -> void {
             grid[i][j] = '0';
             queue<pair<int, int>> q;
             q.push({i, j});