LeetCode 热题 6/100打卡

Python：

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        ans = []
        nums_sorted = sorted(nums)
        for i in range(0,len(nums_sorted)-2):
            if i>0 and nums_sorted[i]==nums_sorted[i-1]:
                continue
            left = i+1
            right = len(nums_sorted)-1
            while left<right:
                s = nums_sorted[i]+nums_sorted[left]+nums_sorted[right]
                if s<0:
                    left+=1
                elif s>0:
                    right-=1
                else:
                    ans.append([nums_sorted[i],nums_sorted[left],nums_sorted[right]])
                    left+=1
                    while nums_sorted[left]==nums_sorted[left-1] and left < len(nums_sorted)-2:
                        left += 1
                    right-=1
                    while nums_sorted[right]==nums_sorted[right+1] and right>1:
                        right -=1
        return ans
        

C++：

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
      vector<vector<int>>ans;
      vector<int>nums_sorted = nums;
      sort(nums_sorted.begin(),nums_sorted.end());
      for(int i =0;i<nums_sorted.size()-2;i++){
            if(i>0 && nums_sorted[i]==nums_sorted[i-1]){
                continue;
            }
            int left = i+1;
            int right = nums_sorted.size()-1;
            while(left<right){
                int s;
                s = nums_sorted[i]+nums_sorted[left]+nums_sorted[right];
                if(s<0){
                    left++;
                }else if(s>0){
                    right--;
                }else{
                    ans.push_back({nums_sorted[i],nums_sorted[left],nums_sorted[right]});
                    left ++;
                    while(left<nums_sorted.size()-1&&nums_sorted[left]==nums_sorted[left-1]){
                        left++;
                    }
                    right --;
                    while (right>1&&nums_sorted[right]==nums_sorted[right+1]){
                        right--;
                    }
                }
            }
      }
      return ans;
    }
};