use std::cmp::Ordering::{Equal,Greater,Less};

pubfnthree_sum(mutnums:Vec<i32>) ->Vec<Vec<i32>>{

nums.sort_unstable();

letmut res =vec![];

for iin0..nums.len() -1{

let n1 = nums[i];

if i >0 && n1 == nums[i -1]{

pubfnthree_sum(mutnumbers:Vec<i32>) ->Vec<Vec<i32>>{

numbers.sort_unstable();

letmut ans:Vec<Vec<i32>> =Vec::new();

for iin0..numbers.len(){

if i >0 && numbers[i] == numbers[i -1]{

let(mut l,mut r) =(i +1, nums.len() -1);

while l < r{

let n2 = nums[l];

let n3 = nums[r];

let sum = n1 + n2 + n3;

if sum >0{

r-=1;

}elseif sum <0{

l+=1;

res.push(vec![n1, n2, n3]);

while l < r && n2 == nums[l +1]{

l+=1;

l+=1;

while l < r && n3 == nums[r -1]{

r-=1;

let(mut l,mut r) =(i +1, numbers.len() -1);

while l < r{

match(numbers[i] + numbers[l] + numbers[r]).cmp(&0){

Less => l +=1,

Greater => r -=1,

Equal =>{

ans.push(vec![numbers[i], numbers[l], numbers[r]]);

l +=1;

while numbers[l] == numbers[l -1] && l < r{

l +=1;

r -=1;

while numbers[r] == numbers[r +1] && l < r{

r -=1;

r-=1;