LeetCode(1)Two Sum


【题目】

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9

Output: index1=1, index2=2

【答案】

一、暴力法:

int *twoSum(int *nums,int numsSize,int target)
{
	int startindex=0;
	int endindex=0;
	int find;
	int *answer;
	answer=(int *)malloc(sizeof(int)*2);
	for (int i=0;i<numsSize;i++)
	{
		int res=target-nums[i];
		find=0;
		for (int j=i+1; j<numsSize;j++)
		{
			if (nums[j]==res)
			{
				startindex=(i<j)?i:j;
				endindex=i+j-startindex;
				find=1;
				break;
			}
		}
		if (find==1)
		{
			answer[0]=startindex+1;
			answer[1]=endindex+1;
			return answer;
		}
	}
	return answer;
}

二、哈希表

vector <int> HashtwoSum(vector<int> &nums,int target)
{
	
	unordered_map<int,int> m;
	int i;
	for ( i=0;i<nums.size();i++)
	{
		m[nums[i]]=i;
	}
	unordered_map<int,int>::iterator it;
	vector <int> answer;
	for ( i=0;i<nums.size();i++)
	{
		int temp=target-nums[i];
		it=m.find(temp);
		if (it!=m.end())
		{
			int index=(*it).second;
			if ( index>i )
			{
				answer.push_back(i+1);
				answer.push_back(index+1);
				return answer;
			}
		}
	}
	return answer;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

赵卓不凡

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值