001 Two Sum - leetcode

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

注意⚠️：
此程序可能会出现如下报错

solution.cpp: In member function twoSum
Line 15: Char 5: error: control reaches end of non-void function [-Werror=return-type]
}

这是因为程序要保证函数一定有返回值，解决办法是在函数末尾写上 return 任意一种正确的函数类型，如下：

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