Skip to content

Latest commit

ย 

History

History
67 lines (54 loc) ยท 1.62 KB

File metadata and controls

67 lines (54 loc) ยท 1.62 KB
class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        set<vector<int>> res;
        for(int i=0;i<nums.size();i++){
            int l = i+1, r = nums.size()-1;

            while(l<r){
                int sum = nums[i]+nums[l]+nums[r];

                if(sum<0){
                    l++;
                }else if(sum>0){
                    r--;
                }else{
                    res.insert({nums[i], nums[l], nums[r]});
                    l++;
                    r--;
                }
            }
        }

        return vector<vector<int>>(res.begin(), res.end());
    }
};
  • set -> vector ์‚ฌ์šฉ ์ด์œ ๋Š” ์ค‘๋ณต ์ œ๊ฑฐ๋ฅผ ์œ„ํ•จ
class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        set<vector<int>> res;
        for(int i=0;i<nums.size();i++){
            if(i != 0 && nums[i] == nums[i-1]) continue;

            int l = i+1, r = nums.size()-1;

            while(l<r){
                int sum = nums[i]+nums[l]+nums[r];

                if(sum<0){
                    l++;
                }else if(sum>0){
                    r--;
                }else{
                    res.insert({nums[i], nums[l], nums[r]});
                    l++;
                    r--;
                }
            }
        }

        return vector<vector<int>>(res.begin(), res.end());

    }
};
  • if(i != 0 && nums[i] == nums[i-1]) continue; ๋ฅผ ํ†ตํ•œ ํƒ์ƒ‰ ๋ฒ”์œ„ ์ค„์ด๊ธฐ ์ตœ์ ํ™” ์ •๋„์˜ ์ฐจ์ด๋กœ ์ƒ / ํ•˜์œ„ ๊ฐˆ๋ฆฌ๋Š” ์ •๋„
  • ๋‹จ์ˆœ 2 pointer๋กœ ์ฒ˜๋ฆฌํ•ด๋„ ๋ฌด๋ฐฉ