Question

How to find all triplets with zero sum in a given array with Rust

Answer 1

#![allow(non_snake_case)]

fn findTripletsWith0Sum(arr : &mut Vec<i32>) {        
    let mut found = false;
    let size = arr.len();
    {
        let mut  i = 0;
        while i < size - 2 {
            {
                let mut  j = i + 1;
                while j < size - 1 {
                    {
                        let mut k = j + 1;
                        while k < size {
                            if arr[i] + arr[j] + arr[k] == 0 {
                                println!("{} + {} + {}", arr[i], arr[j], arr[k]);
                                found = true;
                            }
                            k += 1;
                        }
                    }
                    j += 1;
                }
            }
            i += 1;
        }
    }
        
    if found == false {
        print!("{}","Not found".to_string());
    }
}
    
fn main() {        
    let mut arr : Vec<i32> = vec![1, 0, 3, 2, -1, -2, -3, 4];
    
    findTripletsWith0Sum(&mut arr);
}




/*
run:

1 + 0 + -1
1 + 2 + -3
0 + 3 + -3
0 + 2 + -2
3 + -1 + -2
-1 + -3 + 4

*/

 

70+ SQL courses for beginners and professionals