Solved 1018

Author: guangsheng.li01

src/a1018_binary_prefix_divisible_by_5.rs

@@ -0,0 +1,64 @@
+/*
+ * [1018] binary-prefix-divisible-by-5
+ */
+
+pub struct Solution {}
+
+// solution impl starts here
+
+impl Solution {
+    pub fn prefixes_div_by5(a: Vec<i32>) -> Vec<bool> {
+        let mut result = Vec::with_capacity(a.len());
+        let mut n = 0;
+
+        for i in a {
+            n <<= 1;
+            n += i;
+            result.push(n % 5 == 0);
+            n %= 5;
+        }
+        result
+    }
+}
+
+// solution impl ends here
+
+// solution tests starts here
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_case0() {
+        assert_eq!(
+            Solution::prefixes_div_by5(vec![0, 1, 1]),
+            vec![true, false, false]
+        );
+    }
+
+    #[test]
+    fn test_case1() {
+        assert_eq!(
+            Solution::prefixes_div_by5(vec![1, 1, 1]),
+            vec![false, false, false]
+        );
+    }
+    #[test]
+    fn test_case2() {
+        assert_eq!(
+            Solution::prefixes_div_by5(vec![0, 1, 1, 1, 1, 1]),
+            vec![true, false, false, false, true, false]
+        );
+    }
+
+    #[test]
+    fn test_case3() {
+        assert_eq!(
+            Solution::prefixes_div_by5(vec![1, 1, 1, 0, 1]),
+            vec![false, false, false, false, false]
+        );
+    }
+}
+
+// solution tests ends here

src/lib.rs

@@ -35,6 +35,7 @@ mod a0937_reorder_data_in_log_files;
 mod a0949_largest_time_for_given_digits;
 mod a0973_k_closest_points_to_origin;
 mod a0980_unique_paths_iii;
+mod a1018_binary_prefix_divisible_by_5;
 mod a1021_remove_outermost_parentheses;
 mod a1047_remove_all_adjacent_duplicates_in_string;
 mod a1200_minimum_absolute_difference;