Question

How to merge two sorted vectors without duplicates in Rust

Answer 1

use std::collections::HashSet;

fn merge(arr1: Vec<i32>, arr2: Vec<i32>) -> Vec<i32> {
    let merged_set: HashSet<_> = arr1.into_iter().chain(arr2.into_iter()).collect();
    
    let mut merged_vec: Vec<i32> = merged_set.into_iter().collect();
    
    merged_vec.sort();
    
    merged_vec
}

fn main() {
    let arr1 = vec![1, 2, 2, 3, 7, 7, 7, 8, 9];
    let arr2 = vec![0, 0, 4, 4, 4, 5, 6, 7, 7, 8];
    
    let merged_array = merge(arr1, arr2);
    
    println!("{:?}", merged_array);
}


    
/*
run:

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
  
*/

 

70+ SQL courses for beginners and professionals