8-9-2020

Author: safrannn

src/_0167_two_sum_ii.rs

@@ -0,0 +1,27 @@
+struct Solution;
+
+use std::cmp::Ordering::*;
+
+impl Solution {
+    pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
+        let mut left: usize = 0;
+        let mut right: usize = numbers.len() - 1;
+        while left < right {
+            match (numbers[left] + numbers[right]).cmp(&target) {
+                Equal => {
+                    return vec![left as i32 + 1, right as i32 + 1];
+                }
+                Greater => {
+                    right -= 1;
+                }
+                Less => left += 1,
+            }
+        }
+        return vec![-1, -1];
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(Solution::two_sum(vec![2, 7, 11, 15], 9), vec![1, 2]);
+}

src/_0252_meeting_rooms.rs

@@ -0,0 +1,25 @@
+struct Solution;
+
+impl Solution {
+    pub fn can_attend_meetings(mut intervals: Vec<Vec<i32>>) -> bool {
+        intervals.sort_unstable();
+        for i in 1..intervals.len() {
+            if intervals[i - 1][1] > intervals[i][0] {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(
+        Solution::can_attend_meetings(vec_vec_i32![[0, 30], [5, 10], [15, 20]]),
+        false
+    );
+    assert_eq!(
+        Solution::can_attend_meetings(vec_vec_i32![[7, 10], [2, 4]]),
+        true
+    );
+}

src/_0532_kdiff_pairs_in_an_array.rs

@@ -0,0 +1,47 @@
+struct Solution;
+
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn find_pairs(nums: Vec<i32>, k: i32) -> i32 {
+        if k < 0 {
+            return 0;
+        }
+        if nums.len() < 2 {
+            return 0;
+        }
+        let mut h_map: HashMap<i32, bool> = HashMap::new();
+
+        for v in nums {
+            if let Some(x) = h_map.get_mut(&v) {
+                *x = true;
+            } else {
+                h_map.insert(v, false);
+            }
+        }
+
+        let mut result: i32 = 0;
+        if k == 0 {
+            for (_, value) in h_map.into_iter() {
+                if value {
+                    result += 1;
+                }
+            }
+        } else {
+            for (key, _) in h_map.iter() {
+                let target: i32 = k + key;
+                if h_map.contains_key(&target) {
+                    result += 1;
+                }
+            }
+        }
+        result
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(Solution::find_pairs(vec![3, 1, 4, 1, 5], 2), 2);
+    assert_eq!(Solution::find_pairs(vec![1, 2, 3, 4, 5], 1), 4);
+    assert_eq!(Solution::find_pairs(vec![1, 3, 1, 5, 4], 0), 1);
+}

src/_1539_kth_missing_positive_number.rs

@@ -2,7 +2,6 @@ struct Solution;
 
 impl Solution {
     pub fn find_kth_positive(arr: Vec<i32>, k: i32) -> i32 {
-        let mut arr = arr;
         let mut k = k;
         let mut h_dummy: i32 = 1;
         let mut index: usize = 0;

src/_1540_can_convert_string_in_k_moves.rs

@@ -37,7 +37,7 @@ impl Solution {
 #[test]
 fn test() {
     assert_eq!(
-        Solution::can_convert_string("input".to_string(), "output".to_string(), 9),
+        Solution::can_convert_string("input".to_string(), "ouput".to_string(), 9),
         true
     );
     assert_eq!(

src/lib.rs

@@ -72,6 +72,8 @@ mod _0136_single_number;
 //
 mod _0155_min_stack;
 //
+mod _0167_two_sum_ii;
+//
 mod _0169_majority_element;
 //
 mod _0189_rotate_array;
@@ -98,6 +100,8 @@ mod _0242_valid_anagram;
 //
 mod _0243_shortest_word_distance;
 //
+mod _0252_meeting_rooms;
+//
 mod _0256_paint_house;
 //
 mod _0257_binary_tree_paths;
@@ -138,6 +142,8 @@ mod _0509_fibonacci_number;
 //
 mod _0520_detect_capital;
 //
+mod _0532_kdiff_pairs_in_an_array;
+//
 mod _0556_next_greater_element_iii;
 //
 mod _0557_reverse_words_in_a_string_iii;
@@ -212,4 +218,6 @@ mod _1535_find_the_winner_of_an_array_game;
 //
 mod _1537_get_the_maximum_score;
 //
+mod _1539_kth_missing_positive_number;
+//
 mod _1540_can_convert_string_in_k_moves;