leecode-sum of two numbers

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