algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 04:06:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

update 15.3sum about rust

Browse Source
This commit is contained in:
fw_qaq
2022-10-22 16:42:48 +08:00
committed by GitHub
parent e48ed8a586
commit fddea62f38
1 changed files with 16 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
problems/0015.三数之和.md
View File

@ -655,7 +655,7 @@ impl Solution {
```Rust ```Rust
// 双指针法 // 双指针法
use std::collections::HashSet; use std::cmp::Ordering;
impl Solution { impl Solution {
pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> { pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
let mut result: Vec<Vec<i32>> = Vec::new(); let mut result: Vec<Vec<i32>> = Vec::new();
@ -667,21 +667,20 @@ impl Solution {
if i > 0 && nums[i] == nums[i - 1] { continue; } if i > 0 && nums[i] == nums[i - 1] { continue; }
let (mut left, mut right) = (i + 1, len - 1); let (mut left, mut right) = (i + 1, len - 1);
while left < right { while left < right {
if nums[i] + nums[left] + nums[right] > 0 { match (nums[i] + nums[left] + nums[right]).cmp(&0){
right -= 1; Ordering::Equal =>{
// 去重
while left < right && nums[right] == nums[right + 1] { right -= 1; }
} else if nums[i] + nums[left] + nums[right] < 0 {
left += 1;
// 去重
while left < right && nums[left] == nums[left - 1] { left += 1; }
} else {
result.push(vec![nums[i], nums[left], nums[right]]); result.push(vec![nums[i], nums[left], nums[right]]);
// 去重
right -= 1;
left +=1; left +=1;
while left < right && nums[right] == nums[right + 1] { right -= 1; } right -=1;
while left < right && nums[left] == nums[left - 1] { left += 1; } while left < right && nums[left] == nums[left - 1]{
left += 1;
}
while left < right && nums[right] == nums[right+1]{
right -= 1;
}
}
Ordering::Greater => right -= 1,
Ordering::Less => left += 1,
} }
} }
} }