【leetcode】 两数之和（tow sum）【c++ python】

C++

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

PYTHON

class Solution:
    def twoSum(self, nums, target):
        for i, num in enumerate(nums):
            sub_num = target - num
            if sub_num in nums:
                j = nums.index(sub_num)
                if j != i:
                    return [i, j]

特别注意enumerate函数的用法，也需要注意通过index方法来获取下标