LeetCode题解系列--1. Two Sum
2017-09-09 14:14
591 查看
描述
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].
难度:easy
思路
这题似乎只是让大家熟悉一下这个oj平台。。遍历一下就行了答案
class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> result; for (int i = 0; i < nums.size(); ++i) { for (int j = i + 1; j < nums.size(); ++j) { if (nums[i] + nums[j] == target) { result.push_back(i); result.push_back(j); return result; } } } } };
相关文章推荐
- LeetCode题解系列--121. Best Time to Buy and Sell Stock
- leetcode-Two Sum[题解]
- LeetCode题解系列--714. Best Time to Buy and Sell Stock with Transaction Fee
- LeetCode题解系列--309. Best Time to Buy and Sell Stock with Cooldown
- LeetCode题解系列--122. Best Time to Buy and Sell Stock II
- [LeetCode 题解]: Two Sum
- Leetcode 题解系列(十三)
- 算法练习专题——LeetCode系列之 Two Sum
- LeetCode题解系列--4. Median of Two Sorted Arrays
- leetcode【1+167 Two Sum 系列】【python】
- LeetCode题解系列--188. Best Time to Buy and Sell Stock IV
- LeetCode题解系列--684. Redundant Connection
- LeetCode题解-1-Two Sum
- LeetCode题解系列--685. Redundant Connection II
- Leetcode 题解系列(六)
- LeetCode题解系列--215. Kth Largest Element in an Array
- 【LeetCode】two sum系列
- LeetCode 1 Two Sum 题解
- Leetcode 题解系列(二)
- leetcode题解-1.Two Sum