Leetcode 1, Two Sum
来源:互联网 发布:廊坊市网络招聘 编辑:程序博客网 时间:2024/06/03 16:53
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.(你可以假设对每一个输入都有一个确定的答案)
Example:
Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1].
</pre><pre name="code" class="cpp">class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> vec; for(int i=0;i<nums.size()-1;i++) { for(int j=i+1;j<nums.size();j++) { if(nums[i]+nums[j]==target) { vec.push_back(i); vec.push_back(j); return vec; } } } return vec; }};
0 0
- 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
- 使用引用形参返回额外信息
- c++作业4
- C++上级实验4-求1000以内所有偶数的和
- POJ 1042 Gone Fishing(模拟+贪心)
- 深拷贝与浅拷贝
- Leetcode 1, Two Sum
- swift - NSUserDefaults 的使用
- 【排序算法】选择排序原理及Java实现
- postDelayed方法和removeCallbacks方法的使用
- leetcode——230——Kth Smallest Element in a BST
- OpenCV : InputArray和OutputArray
- 官网 Icinga Version 1.9 Documentation
- Android Bitmap的优化
- 三阶魔方快速还原法还原方法