2017-09-07 LeetCode_001 Two Sum
来源:互联网 发布:手机淘宝登录电脑版 编辑:程序博客网 时间:2024/05/22 06:20
1. 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].
Solutiom:
class Solution {
2
public:
3
vector<int> twoSum(vector<int>& nums, int target) {
4
vector<int> ans;
5
int n = nums.size();
6
for (int i = 0; i < n; i++)
7
for (int j = i+1; j < n; j++)
8
if (nums[i]+nums[j] == target) {
9
ans.push_back(i); ans.push_back(j); return ans;
10
}
11
return ans;
12
}
13
};
阅读全文
1 0
- 2017-09-07 LeetCode_001 Two Sum
- leetcode_001 two sum
- leetcode_001
- Two Sum
- Two Sum
- Two Sum
- two sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Two Sum
- Linx上生成图片的问题
- javaweb——Struts
- Java高级工程师面试总结
- 关于Eclipse下的SVN下载的java工程无法被识别的解决方法
- //写入与LED交互的日志,和LED显示屏的交互日志
- 2017-09-07 LeetCode_001 Two Sum
- 挑战程序竞赛系列(54):4.4 双端队列(1)
- Switch能否用string做参数?
- 图像滤波器 探究(图示+源码)
- 在Python里创建JSON文件
- xpath helper插件:网页爬虫分析工具
- Tensorflow中的物体识别API的demo实现
- 对软件架构设计的一些总结和理解
- Android音频驱动-ASOC之Control Device创建