LeetCode 1 - Two Sum
来源:互联网 发布:淘宝包邮是什么 编辑:程序博客网 时间:2024/05/10 15:55
Two SumMar 14 '11
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
class Solution {public: vector<int> twoSum(vector<int> &numbers, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function int size = numbers.size(); for (int i = 0; i < size; i++) for (int j = i+1; j < size; j++) if (numbers[i] + numbers[j] == target) { vector<int> r; r.push_back(i+1); r.push_back(j+1); return r; } }};
- 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
- leetcode 1 Two Sum
- leetcode #1 Two Sum
- leetcode 1:Two Sum
- LeetCode 1 Two Sum
- leetcode #1 two sum
- 用什么方法推广网站最有效果?
- 读取邮件的方法
- android SQLite使用SQLiteOpenHelper类对数据库进行操作
- Android 中关于Cursor类的介绍
- ASP.NET 操作各类时间段获取当前月的1号和月尾
- LeetCode 1 - Two Sum
- Basic_C# 测试版本发布
- 什么样的外链对SEO有较大的影响?
- Uva-167-The Sultan's Successors
- 实时打印 android 模拟器的内核log信息
- 在面试宝典上看到一例子,要求找编译时的错误
- 什么是ISP(在系统可编程)技术?
- ViewPager获取哪个Page显示给用户
- 两个栈实现队列 两个队列实现栈