Two Sum
2019-08-16 07:49:10来源:博客园 阅读 ()
Two Sum
Two Sum
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].
Code
//
// main.cpp
// STL_Vector
//
// Created by mac on 2019/7/13.
// Copyright ? 2019 mac. All rights reserved.
//
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution{
public:
vector<int> twoSum(vector<int>& nums,int target){
vector<int> result;
for (int i=0; i<nums.size()-1; i++) {
for (int j=i+1; j<nums.size(); j++) {
if (nums[i]!=nums[j]) {
if (nums[i]+nums[j]==target) {
result.push_back(i);
result.push_back(j);
}
}
}
}
return result;
}
};
int main(int argc, const char * argv[]) {
// insert code here...
Solution solu;
vector<int> nums={2, 7, 11, 15};
//int nums [4]= {2, 7, 11, 15};
int target=9;
for (int i=0; i<solu.twoSum(nums, target).size();i++) {
cout<<solu.twoSum(nums, target)[i]<<endl;
}
return 0;
}
运行结果
0
1
Program ended with exit code: 0
参考文献
- https://leetcode.com/problems/two-sum/
原文链接:https://www.cnblogs.com/overlows/p/11184723.html
如有疑问请与原作者联系
标签:
版权申明:本站文章部分自网络,如有侵权,请联系:west999com@outlook.com
特别注意:本站所有转载文章言论不代表本站观点,本站所提供的摄影照片,插画,设计作品,如需使用,请与原作者联系,版权归原作者所有
下一篇:Add Two Numbers
- CodeForces 710D Two Arithmetic Progressions 2020-03-06
- Max Sum 2020-02-17
- bzoj3944 Sum 2019-12-25
- Ural 1248 Sequence Sum 题解 2019-08-16
- DP_Sumsets 2019-08-16
IDC资讯: 主机资讯 注册资讯 托管资讯 vps资讯 网站建设
网站运营: 建站经验 策划盈利 搜索优化 网站推广 免费资源
网络编程: Asp.Net编程 Asp编程 Php编程 Xml编程 Access Mssql Mysql 其它
服务器技术: Web服务器 Ftp服务器 Mail服务器 Dns服务器 安全防护
软件技巧: 其它软件 Word Excel Powerpoint Ghost Vista QQ空间 QQ FlashGet 迅雷
网页制作: FrontPages Dreamweaver Javascript css photoshop fireworks Flash