LeetCode(1)Two Sum
来源:互联网 发布:新加坡 经济形势 数据 编辑:程序博客网 时间:2024/05/16 01:09
【题目】
二、哈希表
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;}
0 0
- LeetCode(1)Two Sum
- LeetCode(1)Two Sum
- leetcode(1) - Two Sum
- leetcode(1)Two Sum
- LeetCode (1)Two Sum | LeetCode
- LeetCode 1 - Two Sum
- leetcode 1 Two Sum
- Leetcode【1】:Two Sum
- [leetcode 1] Two Sum
- 【leetcode-1】Two Sum
- [leetcode 1] Two Sum
- [Leetcode] 1 - Two Sum
- LeetCode (1) Two Sum
- LeetCode 1:《Two Sum》
- LeetCode | #1 Two Sum
- leetcode-1 Two Sum
- Two Sum | LeetCode(1)
- [Leetcode]1Two Sum
- project euler 20
- 8086汇编笔记(标志寄存器)
- HDU 3251 Being a Hero
- ORACLE多表关联UPDATE 语句
- 关于Spring中的配置
- LeetCode(1)Two Sum
- ViewPage + fragement+WebView 滑动卡死
- project euler 21
- Concurrent包
- 线程使用经验
- 性能-客户端测试(二)
- 用户行为分析业务系统日志处理方案
- Python调用C/C++初步
- 一起学libcef--源码文件介绍(VS2015运行DEMO)