2017.2.25 1. Two Sum [easy]
来源:互联网 发布:乐视淘宝旗舰店 编辑:程序博客网 时间:2024/06/08 19:17
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, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1].
Subscribe to see which companies asked this question.
Show Similar Problems
解题思路
题目要求不能重复 ,双重循环从i+1位开始到结尾 好像就没有什么可说的了
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> a;
for(int i=0;i<nums.size();i++)
{
for(int j=i+1;j<nums.size();j++)
{
if(nums[i]+nums[j]==target)
{
a.push_back(i);
a.push_back(j);
}
}
}
return a;
}
};
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> a;
for(int i=0;i<nums.size();i++)
{
for(int j=i+1;j<nums.size();j++)
{
if(nums[i]+nums[j]==target)
{
a.push_back(i);
a.push_back(j);
}
}
}
return a;
}
};
0 0
- 2017.2.25 1. Two Sum [easy]
- 【Easy】1. Two Sum
- 1. Two Sum easy
- 1. Two Sum (Easy)
- 1.[easy] Two Sum
- 1. Two Sum [easy] (Python)
- 1.Two Sum 难度:easy
- leetcode 1. Two Sum [Easy]
- LeetCode 1. Two Sum (Easy)
- Leetcode 1. Two Sum (Easy) (cpp)
- Leetcode 1. Two Sum (Easy) (java)
- Leetcode[Easy] - Two Sum
- 【Leetcode】Two sum(easy)
- Two Sum(easy)
- Two Sum(easy)
- leetcode Two Sum easy
- #1 Two Sum(Easy)
- [Easy]Two Sum
- 面对对象编程总结(二)
- 尺取法
- aria2参数使用说明 所有标签
- SQLServer 中发布与订阅
- Two Sum
- 2017.2.25 1. Two Sum [easy]
- aria2参数说明 bittorrent标签
- c++中new/delete重载总结
- 修改Toolbar返回按钮的颜色
- Python读写excel文件
- WinEdt 7.0 快捷键
- 分隔符,解析字符串
- codeforces 777E Hanoi Factory (栈+贪心)
- Oracle 中,获取指定用户所有有权限访问的表的基本信息、分页实现