Implement 2025 - Day 5 - Part 2

2025/05.rs

@@ -11,27 +11,36 @@ fn main() {
 
         start..=end
     }).collect();
-    println!("Ranges: {:?}", ranges);
 
-    ranges.sort_by_key(|v| *v.start());
+    loop {
-    println!("Ranges: {:?}", ranges);
+        let result: Option<(usize, usize)> = ranges.iter().enumerate().find_map(|(idx, r)| {
+            ranges.iter().enumerate().filter(|(o_idx, _)| idx != *o_idx).find_map(|(o_idx, other)| {
+                r.contains(other.start()).then_some((idx, o_idx))
+            })
+        });
 
-    let ids: Vec<_> = CONTENT.lines().map(|l| l.trim()).skip_while(|l| !l.is_empty()).skip(1).map(|v| v.parse::<usize>().unwrap()).collect();
+        let (idx, o_idx) = match result {
-    println!("IDs: {:?}", ids);
+            Some(r) => r,
+            None => break,
+        };
 
+        let first = ranges[idx].clone();
+        let second = ranges[o_idx].clone();
 
-    let fresh = ids.iter().filter(|id| {
+        let new_range_start: usize = *first.start().min(second.start());
-        for r in ranges.iter() {
+        let new_range_end: usize = *first.end().max(second.end());
-            if r.start() > id {
-                return false;
-            }
 
-            if r.contains(id) {
+        let new_range = new_range_start..=new_range_end;
-                return true;
-            }
-        }
 
-        false
+        println!("Merge\n{:?} +\n{:?} =\n{:?}", first, second, new_range);
-    }).count();
+        ranges[idx] = new_range;
-    println!("Fresh: {:?}", fresh);
+        ranges.remove(o_idx);
+    }
+
+    ranges.sort_by_key(|v| (*v.start(), *v.end()));
+
+    println!("Ranges: \n{:#?}", ranges);
+
+    let result: usize = ranges.iter().map(|r| r.clone().count()).sum();
+    println!("Result: {:?}", result);
 }