leetcode - 01两数之和

selfcode - cpp

时间复杂度读 $O(n^2)$
空间复杂度$O(1)$

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