diff --git a/problems/0015.三数之和.md b/problems/0015.三数之和.md
index fb289d54..5ee57127 100644
--- a/problems/0015.三数之和.md
+++ b/problems/0015.三数之和.md
@@ -655,7 +655,7 @@ impl Solution {
 
 ```Rust
 // 双指针法
-use std::collections::HashSet;
+use std::cmp::Ordering;
 impl Solution {
     pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
         let mut result: Vec<Vec<i32>> = Vec::new();
@@ -667,22 +667,21 @@ impl Solution {
             if i > 0 && nums[i] == nums[i - 1] { continue; }
             let (mut left, mut right) = (i + 1, len - 1);
             while left < right {
-                if nums[i] + nums[left] + nums[right] > 0 {
-                    right -= 1;
-                    // 去重
-                    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]]);
-                    // 去重
-                    right -= 1;
-                    left += 1;
-                    while left < right && nums[right] == nums[right + 1] { right -= 1; }
-                    while left < right && nums[left] == nums[left - 1] { left += 1; }
-                }
+                match (nums[i] + nums[left] + nums[right]).cmp(&0){
+		    Ordering::Equal =>{
+		        result.push(vec![nums[i], nums[left], nums[right]]);
+			left +=1;
+			right -=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,
+		}
             }
         }
         result