Added solution of problem 198

Author: kurpenok

src/solutions/mod.rs

@@ -99,6 +99,7 @@ pub mod s0173_binary_search_tree_iterator;
 pub mod s0179_largest_number;
 pub mod s0187_repeated_dna_sequences;
 pub mod s0189_rotate_array;
+pub mod s0198_house_robber;
 pub mod s0231_power_of_two;
 pub mod s0232_implement_queue_using_stacks;
 pub mod s0234_palindrome_linked_list;

src/solutions/s0198_house_robber.rs

@@ -0,0 +1,34 @@
+pub fn rob(nums: Vec<i32>) -> i32 {
+    if nums.is_empty() {
+        return 0;
+    }
+    if nums.len() == 1 {
+        return nums[0];
+    }
+
+    let mut prev_prev = nums[0];
+    let mut prev = nums[0].max(nums[1]);
+
+    for i in 2..nums.len() {
+        let current = prev_prev + nums[i];
+        prev_prev = prev;
+        prev = current.max(prev);
+    }
+
+    prev
+}
+
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    #[test]
+    fn test_case_1() {
+        assert_eq!(rob(vec![1, 2, 3, 1]), 4);
+    }
+
+    #[test]
+    fn test_case_2() {
+        assert_eq!(rob(vec![2, 7, 9, 3, 1]), 12);
+    }
+}