【LeetCode】算法刷题LEETCODE第一题数组求和twoSum_请编写一个函数 twosum(nums, target),其中 nums 是一个整数数组,targe

一 、算法刷题LEETCODE第一题数组求和twoSum
给一个整形数组sums，给定一个目标值target，编写函数twoSum遍历数组使得数组中两数的和等于target，此时输出这两个数的下标。
二、英文原文
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.
三、测试描述
Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].

Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]

Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]

四、规范要求
Constraints:
2 <= nums.length <= 104
-109 <= nums[i] <= 109
-109 <= target <= 109
Only one valid answer exists.

Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity?

五、博主参考代码
本人用C++写的代码，投石问路，仅供参考。

class Solution{
   
public:
    vector <int> twoSum(vector<int> &nums, int target) {
   
        vector <int> indic;	
        int a=0,b=0;
        indic.resize(2);		
        int n=nums.size();	
        for (int i= 0;i < n-1;i++)    
        {
   
            for (int j=i+1;j < n;j++)    
            {
   
                if ( target == nums[i
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15