LeetCode1:Two Sum

最新推荐文章于 2021-05-01 06:37:49 发布

alxe_made

最新推荐文章于 2021-05-01 06:37:49 发布

阅读量202

点赞数

分类专栏：刷题 LeetCode 文章标签： LeetCode Two Sum

本文链接：https://blog.csdn.net/alxe_made/article/details/88073468

版权

刷题同时被 2 个专栏收录

9 篇文章 0 订阅

订阅专栏

LeetCode

8 篇文章 0 订阅

订阅专栏

1. Two Sum

1.1 description

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].

1.2 暴力解法

直接两层for 循环解决

Cpp Code:

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

时间复杂度 $O(n^2)$
在这里插入图片描述

1.3 HashMap

基础知识：

Cpp Code:

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target){
        unordered_map<int, int>index; 
        for(int i = 0; i < nums.size(); ++i){
            index[nums[i]] = i;
        }
        for(int i = 0; i < nums.size(); ++i){
            int left = target - nums[i];
            if (index.count(left) && i!=index[left]){
                return {i, index[left]};
            }
        }
        return {};    
    }
};