LeetCode - Two Sum
来源:互联网 发布:java原代码 编辑:程序博客网 时间:2024/05/16 11:45
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
vector<int> twoSum(vector<int> &numbers, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function vector<int> rt; rt.push_back(0); rt.push_back(0); if (numbers.size() <= 1) { return rt; } for (unsigned int i = 0; i < numbers.size() - 1; ++i) { for (unsigned int j = i + 1; j < numbers.size(); ++j) { if (numbers[i] + numbers[j] == target) { rt[0] = ++i; rt[1] = ++j; return rt; } } } return rt;}
- 【Leetcode】Two Sum (Sum)
- LeetCode: Two Sum
- LeetCode: Two Sum
- [Leetcode] Two Sum
- LeetCode : Two Sum
- Leetcode: Two Sum
- leetcode 46: Two Sum
- [LeetCode] Two Sum
- LeetCode 1 - Two Sum
- Leetcode : Two Sum
- 【leetcode】Two Sum
- [LeetCode]Two Sum
- leetcode Two Sum
- [Leetcode] Two Sum
- [leetcode] Two Sum
- LeetCode - Two Sum
- leetcode之Two Sum
- LeetCode | Two Sum
- windows7下cmd命令窗口没有滚动条的解救方法
- 数组全排列算法(一)字符串数组全排列——逐个追加组合算法
- 如何简化游戏ui数据更新
- odbc 读取excel
- ViewPager中有Activity的按键捕获问题
- LeetCode - Two Sum
- Lua程序设计第二版(笔记) 第五章函数
- linux启动顺序
- paip.c++ 操作360浏览器总结..
- c语言运算符优先级(记忆口诀)
- 从头到尾理解KMP算法
- 如何成为一个优秀的码农
- Tomcat部署在服务器产生404错误
- [MFC]分割字符串