LeetCode 1 Two Sum

Problem:

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

Summary:

给出数组nums和目标数target，返回数组中相加可得到target的索引值。

Solution:

vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> result;
        int flag = 0;
        
        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);
                    flag = 1;
                    break;
                }
                
                if(flag)
                {
                    break;
                }
            }
        }
        
        return result;
    }