LeetCode - Two Sum / c++

https://leetcode.com/problems/two-sum

Two Sum - LeetCode

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> result;
        for(int i = 0 ;i<nums.size();i++)
        {
            for(int j = i+1;j<nums.size();j++)
            {
                if(nums[i]+nums[j] == target)
                {
                    result.push_back(i);
                    result.push_back(j);
                    goto EXIT;
                }
            }
        }
        EXIT:
        return result;
    }
};

 

두번째 답

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> result;
        map<int,int> m;
        for(int i = 0 ;i<nums.size();i++)
        {
           m[nums[i]] = i;
        }
        
        for(int i = 0 ;i<nums.size();i++)
        {
            int diff = target- nums[i];
            if(m.find(diff)!=m.end())
            {
              if(m[diff] != i)
                {
                   result.push_back(m[diff]);
                  result.push_back(i);
                  break;
                }
            }
        }
        
        return result;
    }
};