[LeetCode] 1. Two Sum

Solution

• Brute Force
• Time Complexity : O(N^2)
• Space Omplexity : O(1)

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

                    return RetVal;
                }
            }
        }

        RetVal.push_back(-1);
        RetVal.push_back(-1);

        return RetVal;
    }
};