feat: add more

Author: gengjiawen

Array/_1603_design_parking_system.rs

@@ -37,29 +37,24 @@ struct ParkingSystem {
 }
 
 impl ParkingSystem {
-
     fn new(big: i32, medium: i32, small: i32) -> Self {
-        ParkingSystem {
-            big,
-            medium,
-            small,
-        }
+        ParkingSystem { big, medium, small }
     }
 
     fn add_car(&mut self, car_type: i32) -> bool {
         match car_type {
             1 => {
                 self.big = self.big - 1;
                 self.big >= 0
-            },
+            }
             2 => {
-                self.medium = self.medium -1;
+                self.medium = self.medium - 1;
                 self.medium >= 0
-            },
+            }
             3 => {
                 self.small = self.small - 1;
                 self.small >= 0
-            },
+            }
             _ => false,
         }
     }

Array/_2303_calculate_amount_paid_in_taxes.rs

@@ -70,5 +70,8 @@ pub fn calculate_tax(brackets: Vec<Vec<i32>>, income: i32) -> f64 {
 
 #[test]
 pub fn t1() {
-    assert_eq!(calculate_tax(vec![vec![3, 50], vec![7, 10], vec![12, 25]], 10), 2.65);
+    assert_eq!(
+        calculate_tax(vec![vec![3, 50], vec![7, 10], vec![12, 25]], 10),
+        2.65
+    );
 }

Array/lib.rs

@@ -105,6 +105,7 @@ mod _1550_three_consecutive_odds;
 mod _1572_matrix_diagonal_sum;
 mod _1582_special_positions_in_a_binary_matrix;
 mod _1588_sum_of_all_odd_length_subarrays;
+mod _1603_design_parking_system;
 mod _1619_mean_of_array_after_removing_some_elements;
 mod _1629_slowest_key;
 mod _1636_sort_array_by_increasing_frequency;
@@ -163,7 +164,6 @@ mod _2248_intersection_of_multiple_arrays;
 mod _2255_count_prefixes_of_a_given_string;
 mod _2273_find_resultant_array_after_removing_anagrams;
 mod _2293_min_max_game;
+mod _2303_calculate_amount_paid_in_taxes;
 mod _2319_check_if_matrix_is_x_matrix;
 mod _2335_minimum_amount_of_time_to_fill_cups;
-mod _2303_calculate_amount_paid_in_taxes;
-mod _1603_design_parking_system;

String/_1678_goal_parser_interpretation.rs

@@ -36,7 +36,7 @@
 // *   `command` consists of `"G"`, `"()"`, and/or `"(al)"` in some order.
 
 pub fn interpret(command: String) -> String {
-    return str::replace(&str::replace(&command, "()", "o"), "(al)", "al").to_string()
+    return str::replace(&str::replace(&command, "()", "o"), "(al)", "al").to_string();
 }
 
 #[test]

String/lib.rs

@@ -2,7 +2,7 @@
 
 mod _0771_jewels_and_stones;
 mod _1119_remove_vowels_from_a_string;
+mod _1678_goal_parser_interpretation;
 mod _1859_sorting_the_sentence;
 mod _2042_check_if_numbers_are_ascending_in_a_sentence;
 mod _2325_decode_the_message;
-mod _1678_goal_parser_interpretation;

Tree/_2236_root_equals_sum_of_children.rs

@@ -29,9 +29,9 @@
 // *   The tree consists only of the root, its left child, and its right child.
 // *   `-100 <= Node.val <= 100`
 
+use crate::base_tree::TreeNode;
 use std::cell::RefCell;
 use std::rc::Rc;
-use crate::base_tree::TreeNode;
 
 pub fn check_tree(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
     let root_node = root.as_ref().unwrap().borrow();

Tree/base_tree.rs

@@ -5,18 +5,18 @@ use std::rc::Rc;
 
 #[derive(Debug, PartialEq, Eq)]
 pub struct TreeNode {
-  pub val: i32,
-  pub left: Option<Rc<RefCell<TreeNode>>>,
-  pub right: Option<Rc<RefCell<TreeNode>>>,
+    pub val: i32,
+    pub left: Option<Rc<RefCell<TreeNode>>>,
+    pub right: Option<Rc<RefCell<TreeNode>>>,
 }
 
 impl TreeNode {
-  #[inline]
-  pub fn new(val: i32) -> Self {
-    TreeNode {
-      val,
-      left: None,
-      right: None
+    #[inline]
+    pub fn new(val: i32) -> Self {
+        TreeNode {
+            val,
+            left: None,
+            right: None,
+        }
     }
-  }
 }

binary_search/_0704_binary_search.rs

@@ -45,5 +45,5 @@ pub fn search(nums: Vec<i32>, target: i32) -> i32 {
 
 #[test]
 pub fn t1() {
-    assert_eq!(search(vec![-1,0,3,5,9,12], 9), 4);
+    assert_eq!(search(vec![-1, 0, 3, 5, 9, 12], 9), 4);
 }

stack/_0739_daily_temperatures.rs

@@ -0,0 +1,68 @@
+// https://leetcode.com/problems/daily-temperatures
+//
+// Given an array of integers `temperatures` represents the daily temperatures, return _an array_ `answer` _such that_ `answer[i]` _is the number of days you have to wait after the_ `i<sup>th</sup>` _day to get a warmer temperature_. If there is no future day for which this is possible, keep `answer[i] == 0` instead.
+//
+// **Example 1:**
+//
+// ```
+// **Input:** temperatures = [73,74,75,71,69,72,76,73]
+// **Output:** [1,1,4,2,1,1,0,0]
+// ```
+//
+// **Example 2:**
+//
+// ```
+// **Input:** temperatures = [30,40,50,60]
+// **Output:** [1,1,1,0]
+// ```
+//
+// **Example 3:**
+//
+// ```
+// **Input:** temperatures = [30,60,90]
+// **Output:** [1,1,0]
+// ```
+//
+// **Constraints:**
+//
+// *   `1 <= temperatures.length <= 10<sup>5</sup>`
+// *   `30 <= temperatures[i] <= 100`
+
+pub fn daily_temperatures_monotonic_stack(temperatures: Vec<i32>) -> Vec<i32> {
+    let mut res = vec![0; temperatures.len()];
+    let mut stack = Vec::new();
+    for i in 0..temperatures.len() {
+        while !stack.is_empty() && temperatures[i] > temperatures[stack[stack.len() - 1]] {
+                let prev = stack.pop().unwrap();
+                res[prev] = (i - prev) as i32;
+        }
+        stack.push(i);
+    }
+
+    return res;
+}
+
+pub fn daily_temperatures_greedy(temperatures: Vec<i32>) -> Vec<i32> {
+    let mut res = vec![0; temperatures.len()];
+    for i in 0..temperatures.len() {
+        for j in i + 1..temperatures.len() {
+            if temperatures[j] > temperatures[i] {
+                res[i] = (j - i) as i32;
+                break;
+            }
+        }
+    }
+    return res;
+}
+
+#[test]
+pub fn t1() {
+    assert_eq!(
+        daily_temperatures_monotonic_stack(vec![73, 74, 75, 71, 69, 72, 76, 73]),
+        vec![1, 1, 4, 2, 1, 1, 0, 0]
+    );
+    assert_eq!(
+        daily_temperatures_greedy(vec![73, 74, 75, 71, 69, 72, 76, 73]),
+        vec![1, 1, 4, 2, 1, 1, 0, 0]
+    );
+}

stack/lib.rs

@@ -3,4 +3,5 @@
 mod _0020_valid_parentheses;
 mod _0022_generate_parentheses;
 mod _0155_min_stack;
+mod _0739_daily_temperatures;
 mod _1598_crawler_log_folder;