From 8b1133512de4047347ec500bee6ebdea5183d0e2 Mon Sep 17 00:00:00 2001
From: jackfiled <xcrenchangjun@outlook.com>
Date: Tue, 25 Feb 2025 15:13:58 +0800
Subject: [PATCH] 20250225 finished.

---
 src/problem/mod.rs                           |   2 +
 src/problem/p2502_design_memory_allocator.rs | 105 +++++++++++++++++++
 2 files changed, 107 insertions(+)
 create mode 100644 src/problem/p2502_design_memory_allocator.rs

diff --git a/src/problem/mod.rs b/src/problem/mod.rs
index 70f6e5f..405943c 100644
--- a/src/problem/mod.rs
+++ b/src/problem/mod.rs
@@ -504,3 +504,5 @@ mod p2506_count_pairs_of_similar_strings;
 mod p1206_design_skiplist;
 
 mod p1656_design_an_ordered_stream;
+
+mod p2502_design_memory_allocator;
diff --git a/src/problem/p2502_design_memory_allocator.rs b/src/problem/p2502_design_memory_allocator.rs
new file mode 100644
index 0000000..9f73961
--- /dev/null
+++ b/src/problem/p2502_design_memory_allocator.rs
@@ -0,0 +1,105 @@
+/**
+ * [2502] Design Memory Allocator
+ */
+pub struct Solution {}
+
+// submission codes start here
+use std::collections::HashMap;
+
+struct Allocator {
+    memory: Vec<bool>,
+    id_map: HashMap<i32, Vec<(usize, usize)>>,
+}
+
+/**
+ * `&self` means the method takes an immutable reference.
+ * If you need a mutable reference, change it to `&mut self` instead.
+ */
+impl Allocator {
+    fn new(n: i32) -> Self {
+        let n = n as usize;
+        Self {
+            memory: vec![false; n],
+            id_map: HashMap::new(),
+        }
+    }
+
+    fn allocate(&mut self, size: i32, m_id: i32) -> i32 {
+        let size = size as usize;
+        let mut start = 0;
+
+        while start < self.memory.len() {
+            let mut pos = start;
+            while pos < self.memory.len() && !self.memory[pos] {
+                if pos - start + 1 == size {
+                    for i in start..=pos {
+                        self.memory[i] = true;
+                    }
+
+                    let entry = self.id_map.entry(m_id).or_insert(vec![]);
+                    entry.push((start, pos));
+                    return start as i32;
+                }
+
+                pos += 1;
+            }
+
+            // 到达这里只能说明找到的空间不足
+            start = pos + 1;
+        }
+
+        -1
+    }
+
+    fn free_memory(&mut self, m_id: i32) -> i32 {
+        if let Some(array) = self.id_map.get(&m_id) {
+            let mut length = 0;
+
+            for &(start, end) in array.iter() {
+                for i in start..=end {
+                    self.memory[i] = false;
+                }
+                length += (end - start + 1) as i32;
+            }
+
+            self.id_map.remove(&m_id);
+            length
+        } else {
+            0
+        }
+    }
+}
+
+/**
+ * Your Allocator object will be instantiated and called as such:
+ * let obj = Allocator::new(n);
+ * let ret_1: i32 = obj.allocate(size, mID);
+ * let ret_2: i32 = obj.free_memory(mID);
+ */
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_2502() {
+        let mut allocator = Allocator::new(10);
+
+        assert_eq!(0, allocator.allocate(1, 1));
+        assert_eq!(1, allocator.allocate(1, 2));
+        assert_eq!(2, allocator.allocate(1, 3));
+
+        assert_eq!(1, allocator.free_memory(2));
+
+        assert_eq!(3, allocator.allocate(3, 4));
+        assert_eq!(1, allocator.allocate(1, 1));
+        assert_eq!(6, allocator.allocate(1, 1));
+
+        assert_eq!(3, allocator.free_memory(1));
+
+        assert_eq!(-1, allocator.allocate(10, 2));
+        assert_eq!(0, allocator.free_memory(7));
+    }
+}