public class Solution extends Object
2267 - Check if There Is a Valid Parentheses String Path.
Hard
A parentheses string is a non-empty string consisting only of '(' and ')'. It is valid if any of the following conditions is true:
().AB (A concatenated with B), where A and B are valid parentheses strings.(A), where A is a valid parentheses string.You are given an m x n matrix of parentheses grid. A valid parentheses string path in the grid is a path satisfying all of the following conditions:
(0, 0).(m - 1, n - 1).Return true if there exists a valid parentheses string path in the grid. Otherwise, return false.
Example 1:

Input: grid = [[“(”,“(”,“(”],[“)”,“(”,“)”],[“(”,“(”,“)”],[“(”,“(”,“)”]]
Output: true
Explanation: The above diagram shows two possible paths that form valid parentheses strings.
The first path shown results in the valid parentheses string “()(())”.
The second path shown results in the valid parentheses string “((()))”.
Note that there may be other valid parentheses string paths.
Example 2:

Input: grid = [[“)”,“)”],[“(”,“(”]]
Output: false
Explanation: The two possible paths form the parentheses strings “))(” and “)((”. Since neither of them are valid parentheses strings, we return false.
Constraints:
m == grid.lengthn == grid[i].length1 <= m, n <= 100grid[i][j] is either '(' or ')'.| Constructor and Description |
|---|
Solution() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
hasValidPath(char[][] grid) |
Copyright © 2022. All rights reserved.