leetcode-solutions 0.1.1

A collection of leetcode solution in rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

/*
 * No: 2007
 * Title: Find Original Array From Doubled Array
 */

use crate::Solution;

impl Solution {
    pub fn find_original_array(changed: Vec<i32>) -> Vec<i32> {
        use std::collections::HashMap;

        if changed.len() % 2 != 0 {
            return vec![];
        }

        let mut changed = changed.clone();
        changed.sort();

        let mut original: Vec<i32> = vec![];

        let mut element_indexes: HashMap<i32, usize> = HashMap::new();
        changed.iter().enumerate().for_each(|(_, val)| {
            *element_indexes.entry(*val).or_insert(0) += 1;
        });

        print!("{:?}", element_indexes);

        for value in changed.into_iter() {
            let count = *element_indexes.get(&value).unwrap();
            if count != 0 {
                original.push(value);
                let double = value * 2;
                if element_indexes.contains_key(&double) && element_indexes[&double] > 0 {
                    element_indexes.insert(double, element_indexes[&double] - 1);
                } else {
                    return vec![];
                }

                let count = *element_indexes.get(&value).unwrap();
                element_indexes.insert(value, count - 1);
            }
        }

        print!("{:?}", element_indexes);

        original
    }
}