2274. Maximum Consecutive Floors Without Special Floors: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1722,3 +1722,4 @@ mod s2270_number_of_ways_to_split_array;
 mod s2271_maximum_white_tiles_covered_by_a_carpet;
 mod s2272_substring_with_largest_variance;
 mod s2273_find_resultant_array_after_removing_anagrams;
+mod s2274_maximum_consecutive_floors_without_special_floors;

src/solution/s2274_maximum_consecutive_floors_without_special_floors.rs

@@ -0,0 +1,74 @@
+/**
+ * [2274] Maximum Consecutive Floors Without Special Floors
+ *
+ * Alice manages a company and has rented some floors of a building as office space. Alice has decided some of these floors should be special floors, used for relaxation only.
+ * You are given two integers bottom and top, which denote that Alice has rented all the floors from bottom to top (inclusive). You are also given the integer array special, where special[i] denotes a special floor that Alice has designated for relaxation.
+ * Return the maximum number of consecutive floors without a special floor.
+ *  
+ * Example 1:
+ *
+ * Input: bottom = 2, top = 9, special = [4,6]
+ * Output: 3
+ * Explanation: The following are the ranges (inclusive) of consecutive floors without a special floor:
+ * - (2, 3) with a total amount of 2 floors.
+ * - (5, 5) with a total amount of 1 floor.
+ * - (7, 9) with a total amount of 3 floors.
+ * Therefore, we return the maximum number which is 3 floors.
+ *
+ * Example 2:
+ *
+ * Input: bottom = 6, top = 8, special = [7,6,8]
+ * Output: 0
+ * Explanation: Every floor rented is a special floor, so we return 0.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= special.length <= 10^5
+ * 	1 <= bottom <= special[i] <= top <= 10^9
+ * 	All the values of special are unique.
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/maximum-consecutive-floors-without-special-floors/
+// discuss: https://leetcode.com/problems/maximum-consecutive-floors-without-special-floors/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn max_consecutive(bottom: i32, top: i32, special: Vec<i32>) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2274_example_1() {
+        let bottom = 2;
+        let top = 9;
+        let special = vec![4, 6];
+
+        let result = 3;
+
+        assert_eq!(Solution::max_consecutive(bottom, top, special), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2274_example_2() {
+        let bottom = 6;
+        let top = 8;
+        let special = vec![7, 6, 8];
+
+        let result = 0;
+
+        assert_eq!(Solution::max_consecutive(bottom, top, special), result);
+    }
+}