第七周OJ-Q1解题方法

最新推荐文章于 2022-08-07 15:16:14 发布

lyf3068

最新推荐文章于 2022-08-07 15:16:14 发布

阅读量260

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/lyf3068/article/details/69937998

版权

算法专栏收录该内容

11 篇文章 0 订阅

订阅专栏

题目

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

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

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

这道题目相对比较简单，所以用暴力的方法即可，i从头遍历，j从i+1到最后遍历。如果两个相加等于target，就返回i，j。源码如下：

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

                }
            }
        }
    }
};