solution: Generate Parentheses

Author: Kilerd

Cargo.toml

@@ -2,6 +2,4 @@
 name = "leetcode"
 version = "0.1.0"
 authors = ["Kilerd Chan <[email protected]>"]
-edition = "2018"
-
-[workspace]
+edition = "2018"

src/generate_parentheses.rs

@@ -0,0 +1,40 @@
+/// @number 22
+/// @title Generate Parentheses
+/// @url https://leetcode.com/problems/generate-parentheses/
+/// @difficulty Medium
+
+struct Solution;
+
+impl Solution {
+    pub fn generate_parenthesis(n: i32) -> Vec<String> {
+        if n == 0 {
+            return vec!["".to_string()];
+        }
+        let mut ans = vec![];
+        for i in 0..=n - 1 {
+            for left in Solution::generate_parenthesis(n - 1 - i) {
+                for right in Solution::generate_parenthesis(i) {
+                    ans.push(format!("({}){}", left, right));
+                }
+            }
+        }
+        ans
+    }
+}
+
+#[cfg(test)]
+mod test {
+    use crate::generate_parentheses::Solution;
+
+    #[test]
+    fn test() {
+        let expected = vec!["((()))", "(()())", "(())()", "()(())", "()()()"];
+        let expected: Vec<String> = expected.into_iter().map(|item| item.to_string()).collect();
+        assert_eq!(expected, Solution::generate_parenthesis(3));
+    }
+    #[test]
+    fn test_n_equals_0() {
+        let expected: Vec<String> = vec!["".to_string()];
+        assert_eq!(expected, Solution::generate_parenthesis(0));
+    }
+}

src/main.rs

@@ -1,36 +1,41 @@
-mod list;
-mod zigzag_conversion;
 mod add_two_number;
-mod jewels_and_stones;
-mod nim_game;
-mod unique_email_addresses;
-mod to_lower_case;
-mod unique_morse_code_words;
-mod sort_array_by_parity;
-mod robot_return_to_origin;
-mod hamming_distance;
-mod di_string_match;
+mod array_partition_i;
 mod big_countries;
+mod container_with_most_water;
+mod di_string_match;
+mod divide_two_integers;
 mod flipping_an_image;
+mod generate_parentheses;
+mod hamming_distance;
+mod implement_strstr;
+mod integer_to_roman;
+mod jewels_and_stones;
+mod letter_combinations_of_a_phone_number;
+mod list;
+mod longest_substring_without_repeating_characters;
 mod merge_two_binary_trees;
-mod two_sum;
+mod nim_game;
+mod number_of_recent_calls;
+mod palindrome_number;
 mod peak_index_in_a_mountain_array;
+mod remove_duplicates_from_sorted_array;
+mod remove_element;
+mod reverse_integer;
+mod robot_return_to_origin;
 mod self_dividing_numbers;
-mod array_partition_i;
-mod number_of_recent_calls;
+mod sort_array_by_parity;
 mod sort_array_by_parity_ii;
-mod longest_substring_without_repeating_characters;
 mod sort_colors;
-mod reverse_integer;
-mod integer_to_roman;
 mod string_to_integer_atoi;
-mod palindrome_number;
-mod container_with_most_water;
 mod three_sum;
 mod three_sum_closest;
-mod letter_combinations_of_a_phone_number;
+mod to_lower_case;
+mod two_sum;
+mod unique_email_addresses;
+mod unique_morse_code_words;
 mod valid_parentheses;
-mod remove_duplicates_from_sorted_array;
-mod remove_element;
-mod implement_strstr;
-mod divide_two_integers;
+mod zigzag_conversion;
+
+fn main() {
+    println!("hello leetcode");
+}