2267. Check if There Is a Valid Parentheses String Path: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1716,3 +1716,4 @@ mod s2262_total_appeal_of_a_string;
 mod s2264_largest_3_same_digit_number_in_string;
 mod s2265_count_nodes_equal_to_average_of_subtree;
 mod s2266_count_number_of_texts;
+mod s2267_check_if_there_is_a_valid_parentheses_string_path;

src/solution/s2267_check_if_there_is_a_valid_parentheses_string_path.rs

@@ -0,0 +1,86 @@
+/**
+ * [2267]  Check if There Is a Valid Parentheses String Path
+ *
+ * A parentheses string is a non-empty string consisting only of '(' and ')'. It is valid if any of the following conditions is true:
+ *
+ * 	It is ().
+ * 	It can be written as AB (A concatenated with B), where A and B are valid parentheses strings.
+ * 	It can be written as (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:
+ *
+ * 	The path starts from the upper left cell (0, 0).
+ * 	The path ends at the bottom-right cell (m - 1, n - 1).
+ * 	The path only ever moves down or right.
+ * 	The resulting parentheses string formed by the path is valid.
+ *
+ * Return true if there exists a valid parentheses string path in the grid. Otherwise, return false.
+ *  
+ * Example 1:
+ * <img alt="" src="https://assets.leetcode.com/uploads/2022/03/15/example1drawio.png" style="width: 521px; height: 300px;" />
+ * 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:
+ * <img alt="" src="https://assets.leetcode.com/uploads/2022/03/15/example2drawio.png" style="width: 165px; height: 165px;" />
+ * 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.length
+ * 	n == grid[i].length
+ * 	1 <= m, n <= 100
+ * 	grid[i][j] is either '(' or ')'.
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path/
+// discuss: https://leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn has_valid_path(grid: Vec<Vec<char>>) -> bool {
+        false
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2267_example_1() {
+        let grid = vec![
+            vec!['(', '(', '('],
+            vec![')', '(', ')'],
+            vec!['(', '(', ')'],
+            vec!['(', '(', ')'],
+        ];
+
+        let result = true;
+
+        assert_eq!(Solution::has_valid_path(grid), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2267_example_2() {
+        let grid = vec![vec![')', ')'], vec!['(', '(']];
+
+        let result = false;
+
+        assert_eq!(Solution::has_valid_path(grid), result);
+    }
+}