Update check-if-there-is-a-valid-parentheses-string-path.cpp

Author: kamyu104

C++/check-if-there-is-a-valid-parentheses-string-path.cpp

@@ -36,7 +36,7 @@ class Solution_WA {
             for (int j = 0; j < size(grid[0]); ++j) {
                 const int d = (grid[i][j] == '(') ? 1 : -1;
                 dp[j + 1] = {min(dp[j + 1].first, dp[j].first) + d, max(dp[j + 1].second, dp[j].second) + d};
-                // bitset pattern is like xxx1010101xxxx (in fact, it is not always true in this problem)
+                // bitset pattern is like xxx1010101xxxx (in fact, it is not always true in this problem where some paths are invalid)
                 if (dp[j + 1].second < 0) {
                     dp[j + 1] = {MAX_M + MAX_N, -(MAX_M + MAX_N)};
                 } else {