[LeetCode 1] Two Sum

안녕하십니까. Eun🦆입니다.

풀이법 입니다.

 

Two Sum - LeetCode

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

 

네이버 블로그 리뉴얼입니다.

(https://blog.naver.com/unsuk1/222036043633)