erius/leetcode
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Implemented problem 15

Browse source
This commit is contained in:
Egor 2024-04-20 10:57:56 +03:00
parent 3e15c5bd78
commit c9e582b553
1 changed files with 17 additions and 11 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
src/bin/15_3sum.rs
View file

@ -1,26 +1,32 @@
fn main() {
println!("{:?}", three_sum(vec![-1,0,1,2,-1,-4]));
println!("{:?}", three_sum(vec![0,0,0,0,0,0]));
println!("{:?}", three_sum(vec![-2,0,0,2,2]));
}
// TODO: fix and optimize
pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
let mut result: Vec<Vec<i32>> = Vec::new();
let mut seen = std::collections::HashSet::<i32>::with_capacity(nums.len());
let mut seen2 = std::collections::HashSet::<i32>::with_capacity(nums.len()-1);
let mut result = Vec::<Vec<i32>>::new();
nums.sort();
for i in 0..nums.len()-2 {
if seen.contains(&nums[i]) { continue; }
for j in i+1..nums.len()-1 {
if seen2.contains(&nums[j]) { continue; }
for k in j+1..nums.len() {
if nums[i] + nums[j] + nums[k] == 0 {
if i > 0 && nums[i] == nums[i - 1] { continue; }
let (mut j, mut k) = (i + 1, nums.len() - 1);
while j < k {
if j > i + 1 && nums[j - 1] == nums[j] {
j += 1; continue;
}
if k < nums.len() - 1 && nums[k + 1] == nums[k] {
k -= 1; continue;
}
match (nums[i] + nums[j] + nums[k]).cmp(&0) {
std::cmp::Ordering::Less => { j += 1; },
std::cmp::Ordering::Greater => { k -= 1 },
std::cmp::Ordering::Equal => {
result.push(vec![nums[i], nums[j], nums[k]]);
j += 1; k -= 1;
}
}
seen2.insert(nums[j]);
}
seen.insert(nums[i]);
seen2.clear();
}
return result;
}