From 677ac9b9ff73cfe96af6af84a4886b2dfd3bec58 Mon Sep 17 00:00:00 2001 From: SquidSpirit Date: Sat, 20 Sep 2025 02:08:30 +0800 Subject: [PATCH] feat: 2349_design_a_number_container_system --- .../Cargo.lock | 7 +++ .../Cargo.toml | 6 +++ .../src/lib.rs | 51 +++++++++++++++++++ 3 files changed, 64 insertions(+) create mode 100644 2349_design_a_number_container_system/Cargo.lock create mode 100644 2349_design_a_number_container_system/Cargo.toml create mode 100644 2349_design_a_number_container_system/src/lib.rs diff --git a/2349_design_a_number_container_system/Cargo.lock b/2349_design_a_number_container_system/Cargo.lock new file mode 100644 index 0000000..8e7cf7a --- /dev/null +++ b/2349_design_a_number_container_system/Cargo.lock @@ -0,0 +1,7 @@ +# This file is automatically @generated by Cargo. +# It is not intended for manual editing. +version = 4 + +[[package]] +name = "design_a_number_container_system" +version = "0.1.0" diff --git a/2349_design_a_number_container_system/Cargo.toml b/2349_design_a_number_container_system/Cargo.toml new file mode 100644 index 0000000..d483e21 --- /dev/null +++ b/2349_design_a_number_container_system/Cargo.toml @@ -0,0 +1,6 @@ +[package] +name = "design_a_number_container_system" +version = "0.1.0" +edition = "2024" + +[dependencies] diff --git a/2349_design_a_number_container_system/src/lib.rs b/2349_design_a_number_container_system/src/lib.rs new file mode 100644 index 0000000..d689a51 --- /dev/null +++ b/2349_design_a_number_container_system/src/lib.rs @@ -0,0 +1,51 @@ +use std::{ + cmp::Reverse, + collections::{BinaryHeap, HashMap}, +}; + +pub struct NumberContainers { + // k: idx, v: num + numbers: HashMap, + + // k: num, v: idxs + min_heaps: HashMap>>, +} + +impl NumberContainers { + pub fn new() -> Self { + Self { + numbers: HashMap::new(), + min_heaps: HashMap::new(), + } + } + + pub fn change(&mut self, index: i32, number: i32) { + self.numbers.insert(index, number); + if let Some(heap) = self.min_heaps.get_mut(&number) { + heap.push(Reverse(index)); + } else { + let mut heap = BinaryHeap::new(); + heap.push(Reverse(index)); + self.min_heaps.insert(number, heap); + } + } + + pub fn find(&mut self, number: i32) -> i32 { + let mut result = -1; + + if let Some(heap) = self.min_heaps.get_mut(&number) { + while let Some(Reverse(smallest_index)) = heap.peek() { + if let Some(num_from_idx) = self.numbers.get(smallest_index) + && num_from_idx == &number + { + result = *smallest_index; + break; + } else { + heap.pop(); + } + } + } + + result + } +}