LeetCode 1.Two Sum

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