add solution for 13, 78, 704, 811 and remove 1737

Author: safrannn

src/_0013_roman_to_integer.rs

@@ -0,0 +1,39 @@
+struct Solution;
+
+impl Solution {
+ pub fn roman_to_int(s: String) -> i32 {
+ let look_up = |c: &char| -> i32 {
+ match c {
+ 'I' => 1,
+ 'V' => 5,
+ 'X' => 10,
+ 'L' => 50,
+ 'C' => 100,
+ 'D' => 500,
+ 'M' => 1000,
+ _ => 0,
+ }
+ };
+
+ let chars = s.chars().collect::<Vec<char>>();
+ let mut prev = 'I';
+ let mut result = 0;
+ for i in (0..s.len()).rev() {
+ let c = &chars[i];
+ if look_up(c) < look_up(&prev) {
+ result -= look_up(c);
+ } else {
+ result += look_up(c);
+ prev = *c;
+ }
+ }
+ result
+ }
+}
+
+#[test]
+fn test() {
+ assert_eq!(Solution::roman_to_int("III".to_string()), 3);
+ assert_eq!(Solution::roman_to_int("LVIII".to_string()), 58);
+ assert_eq!(Solution::roman_to_int("MCMXCIV".to_string()), 1994);
+}

src/_0078_subsets.rs

@@ -2,27 +2,19 @@ struct Solution;
 
 impl Solution {
  pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
- let mut result: Vec<Vec<i32>> = vec![];
- let mut current: Vec<i32> = vec![];
- let n: usize = nums.len();
- Self::dfs(&nums, 0, &n, &mut result, &mut current);
+ let mut result = vec![];
+ Self::dfs(&nums, 0, &mut vec![], &mut result);
  result
  }
 
- fn dfs(
- nums: &Vec<i32>,
- i: usize,
- n: &usize,
- result: &mut Vec<Vec<i32>>,
- current: &mut Vec<i32>,
- ) {
- if i == *n {
- result.push(current.to_vec());
+ fn dfs(nums: &Vec<i32>, i: usize, current: &mut Vec<i32>, result: &mut Vec<Vec<i32>>) {
+ if i == nums.len() {
+ result.push(current.clone());
  } else {
- Self::dfs(nums, i + 1, n, result, current);
  current.push(nums[i]);
- Self::dfs(nums, i + 1, n, result, current);
+ Self::dfs(&nums, i + 1, current, result);
  current.pop();
+ Self::dfs(&nums, i + 1, current, result);
  }
  }
 }

src/_0704_binary_search.rs

@@ -0,0 +1,24 @@
+struct Solution;
+
+impl Solution {
+ pub fn search(nums: Vec<i32>, target: i32) -> i32 {
+ let (mut i, mut j) = (0, (nums.len() - 1) as i32);
+ while i <= j {
+ let mid = (i + j) / 2;
+ if nums[mid as usize] == target {
+ return mid as i32;
+ } else if nums[mid as usize] < target {
+ i = mid + 1;
+ } else {
+ j = mid - 1;
+ }
+ }
+ -1
+ }
+}
+
+#[test]
+fn test() {
+ assert_eq!(Solution::search(vec![-1, 0, 3, 5, 9, 12], 9), 4);
+ assert_eq!(Solution::search(vec![-1, 0, 3, 5, 9, 12], 2), -1);
+}

src/_0811_subdomain_visit_count.rs

@@ -0,0 +1,27 @@
+// struct Solution;
+// use std::collections::HashMap;
+
+// impl Solution {
+// pub fn subdomain_visits(cpdomains: Vec<String>) -> Vec<String> {
+// let mut map: HashMap<&str, i32> = HashMap::new();
+// for domain in cpdomains {
+// let domain_array: Vec<&str> = domain.split(" ").collect();
+// let occur: i32 = domain_array[0].parse().unwrap();
+// let d: Vec<&str> = domain_array[1].split(".").collect();
+// for v in d {
+// let count = map.entry(v).or_default();
+// *count += occur;
+// }
+// }
+// let mut result: Vec<String> = vec![];
+// for (domain, count) in map {
+// result.push(format!("{} {}", count, domain));
+// }
+// result
+// }
+// }
+
+// #[test]
+// fn test() {
+// // assert_eq!(Solution::subdomain_visits(vec!["9001 discuss.leetcode.com".to_string()]), true);
+// }

src/_1737_change_minimum_characters_to_satisfy_one_of_three_conditions.rs

@@ -24,6 +24,8 @@ mod _0009_palindrome_number;
 //
 mod _0011_container_with_most_water;
 //
+mod _0013_roman_to_integer;
+//
 mod _0014_longest_common_prefix;
 //
 mod _0015_3sum;
@@ -244,6 +246,8 @@ mod _0692_top_k_frequent_words;
 //
 mod _0696_count_binary_substrings;
 //
+mod _0704_binary_search;
+//
 mod _0724_find_pivot_index;
 //
 mod _0735_asteroid_collision;
@@ -380,8 +384,6 @@ mod _1726_tuple_with_same_product;
 //
 mod _1736_latest_time_by_replacing_hidden_digits;
 //
-mod _1737_change_minimum_characters_to_satisfy_one_of_three_conditions;
-//
 mod _1742_maximum_number_of_balls_in_a_box;
 //
 mod _1748_sum_of_unique_elements;