12/5/2020

Author: safrannn

README.md

@@ -88,6 +88,7 @@ leetcode practise solution in rust
 |404|[Sum of Left Leaves](src/_0404_sum_of_left_leaves.rs)|
 |412|[Fizz Buzz ](src/_0412_fizz_buzz.rs)|
 |415|[Add Strings ](src/_0415_add_strings.rs)|
+|437|[Path Sum III](src/_0437_path_sum_iii.rs)|
 |443|[String Compression](src/_0443_string_compression.rs)|
 |448|[Find All Numbers Disappeared in an Array](src/_0448_find_all_numbers_disappeared_in_an_array.rs)|
 |470|[Implement Rand10() Using Rand7()](src/_0470_implement_rand10_using_rand7.rs)|
@@ -151,4 +152,6 @@ leetcode practise solution in rust
 |1598|[Crawler Log Folder](src/_1598_rawler_log_folder.rs)|
 |1608|[Special Array With X Elements Greater Than or Equal X](src/_1608_special_array_with_x_elements_greater_than_or_equal_x.rs)|
 |1609|[Even Odd Tree](src/_1609_even_odd_tree.rs)|
-
+|1678|[Goal Parser Interpretation](src/_1678_goal_parser_interpretation.rs)|
+|1679|[Max Number of K-Sum Pairs](src/_1679_max_number_of_k-sum_pairs.rs)|
+|1680|[Concatenation of Consecutive Binary Numbers](src/_1680_concatenation_of_consecutive_binary_numbers.rs)|

src/_0437_path_sum_iii.rs

@@ -0,0 +1,22 @@
+struct Solution;
+impl Solution {
+ pub fn interpret(command: String) -> String {
+ command.replace("()", "o").replace("(al)", "al")
+ }
+}
+
+#[test]
+fn test() {
+ assert_eq!(
+ Solution::max_operations("G()(al)".to_string()),
+ "Goal".to_string()
+ );
+ assert_eq!(
+ Solution::max_operations("G()()()()(al)".to_string()),
+ "Gooooal".to_string()
+ );
+ assert_eq!(
+ Solution::max_operations("(al)G(al)()()G".to_string()),
+ "alGalooG".to_string()
+ );
+}

src/_1678_goal_parser_interpretation.rs

@@ -0,0 +1,27 @@
+use std::collections::HashMap;
+
+struct Solution;
+impl Solution {
+ pub fn max_operations(nums: Vec<i32>, k: i32) -> i32 {
+ let mut occurs: HashMap<i32, i32> = HashMap::new();
+ let mut result = 0;
+ for v1 in nums {
+ let v2 = k - v1;
+ if let Some(occur) = occurs.get_mut(&v2) {
+ if *occur > 0 {
+ *occur -= 1;
+ result += 1;
+ continue;
+ }
+ }
+ *occurs.entry(v1).or_default() += 1;
+ }
+ result
+ }
+}
+
+#[test]
+fn test() {
+ assert_eq!(Solution::max_operations(vec![1, 2, 3, 4], 2), 5);
+ assert_eq!(Solution::max_operations(vec![3, 1, 3, 4, 3], 6), 1);
+}

src/_1679_max_number_of_k-sum_pairs.rs

@@ -0,0 +1,29 @@
+struct Solution;
+
+impl Solution {
+ pub fn concatenated_binary(n: i32) -> i32 {
+ let mut result: usize = 0;
+ for i in 1..=n as usize {
+ result <<= Self::binary_digits(i);
+ result += i;
+ result %= 1_000_000_007;
+ }
+ result as i32
+ }
+
+ fn binary_digits(mut decimal: usize) -> usize {
+ let mut bits = 0;
+ while decimal > 0 {
+ bits += 1;
+ decimal >> 1;
+ }
+ bits
+ }
+}
+
+#[test]
+fn test() {
+ assert_eq!(Solution::concatenated_binary(1), 1);
+ assert_eq!(Solution::concatenated_binary(3), 3);
+ assert_eq!(Solution::concatenated_binary(12), 505379714);
+}

src/_1680_concatenation_of_consecutive_binary_numbers.rs

@@ -176,6 +176,8 @@ mod _0412_fizz_buzz;
 //
 mod _0415_add_strings;
 //
+mod _0437_path_sum_iii;
+//
 mod _0443_string_compression;
 //
 mod _0448_find_all_numbers_disappeared_in_an_array;
@@ -311,3 +313,6 @@ mod _1608_special_array_with_x_elements_greater_than_or_equal_x;
 mod _1609_even_odd_tree;
 //
 mod test;
+
+//
+mod temp1;