1:第一题

最新推荐文章于 2022-11-02 23:38:44 发布

xxl10000

最新推荐文章于 2022-11-02 23:38:44 发布

阅读量123

点赞数

分类专栏： LeetCode 文章标签： code

本文链接：https://blog.csdn.net/xxl10000/article/details/89812965

版权

LeetCode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Problem

\1. Two Sum

Easy

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

First Submit AC

vector<int> twoSum(vector<int>& nums, int target) {
		vector<int> Result;
		int length = nums.size();
		for (size_t i = 0; i < length - 1; i++)
		{
			for (size_t j = i + 1; j < length; j++)
			{
				if (nums[i] + nums[j] == target)
				{
					Result.push_back(i);
					Result.push_back(j);
					return Result;
				}
			}
		}
		return Result;
}

提交问题：

只有if里面有return, 但是最后没有return也没有throw，会显示编译错误

Online Way

利用hash表，查找补数（如2+7=9，对于2，查找7，而hash对于查找）,优化可以边查找边建立hash表，而不优化为直接建立一个完整的hash表。

Improve Field

思考数据结构用于代码，这需要用什么数据结构？

Reduced Code

#include<unordered_map>
class Solution {
public:
    
	vector<int> twoSum(vector<int>& nums, int target) {
		unordered_map<int, int> mymap;
		vector<int> V;
        unordered_map<int, int>::iterator It;
		int Number2;
		int length = nums.size();
		for (size_t i = 0; i < length; i++)
		{
			Number2 = target - nums[i];
			It = mymap.find(Number2);
			if (It != mymap.end())
			{
				V.push_back(It->second);
				V.push_back(i);
				return V;
			}
			else
			{
				mymap[nums[i]] = i;
			}
		}
		throw ;
	}
};

Tips Learning

unordered_map用法

// 定义第一个 unordered_map
	std::unordered_map<std::string, int> mymap = { { "Mars", 3000 }, { "Saturn", 60000 }, { "Jupiter", 70000 } };
	//插入
	mymap.insert(pair<string, int>("good", 2));
	mymap["Earth"] = 23;
	auto It = mymap.end();
	It--;
	//bug:mymap.insert(It, (unordered_map<string, int>)("good1", 3));
	mymap.insert(It, pair<string, int>("good1", 3));

	//查找
	It = mymap.find("Mars");
	if (It != mymap.end())
	{
		cout << "Success Find" << It->first << endl;
	}

	//删除
	mymap.erase("Mars");
	It = mymap.begin();
	cout << "erase find"<<It->first << endl;
	
	mymap.erase(It);  
	// erased : It->first but;cout << "erase"<<It->first << endl;