Runtime: 1 ms (Top 83.3%) | Memory: 2.16 MB (Top 16.6%)

Author: AnasImloul

scripts/algorithms/M/Minimum Cost Tree From Leaf Values/Minimum Cost Tree From Leaf Values.rs

@@ -0,0 +1,28 @@
+// Runtime: 1 ms (Top 83.3%) | Memory: 2.16 MB (Top 16.6%)
+
+use std::cmp::min;
+impl Solution {
+    pub fn mct_from_leaf_values(mut arr: Vec<i32>) -> i32 {
+        let n = arr.len();
+        let mut A:Vec<i32> = vec![];
+        A.push(std::i32::MAX);
+        A.append(&mut arr);
+        A.push(std::i32::MAX);
+        let mut res = 0;        
+        while A.len()>3{
+            let min_index = min_index(&A);
+            res+=min(A[min_index-1],A[min_index+1]) * A[min_index];
+            A.remove(min_index);
+        }
+        return res;
+    }
+}
+pub fn min_index(array: &Vec<i32>) -> usize {
+    let mut i = 0;
+    for (j, &value) in array.iter().enumerate() {
+        if value < array[i] {
+            i = j;
+        }
+    }
+    return i;
+}