leetcode two sum
2013-05-20 13:27
344 查看
class Solution { public: vector<int> twoSum(vector<int> &numbers, int target) { vector<int>output; int i,j; for(i=0;i<numbers.size()-1;i++) { for(j=numbers.size()-1;j>i;j--) { if(numbers[i]+numbers[j]==target) { output.push_back(i+1); output.push_back(j+1); } } } return output; } };
相关文章推荐
- [Leetcode] Two Sum
- [Leetcode] 1. Two Sum
- Two sum-LeetCode
- LeetCode 001 Two Sum
- leetcode : Two Sum
- Two Sum (leetcode)
- Leetcode-1:Two Sum
- LeetCode 解题报告 Two Sum
- leetcode--Two Sum
- LeetCode:Two Sum
- LeetCode 1. Two Sum
- LeetCode (1) Two Sum
- LeetCode #1Two Sum
- Leetcode[Easy] - Two Sum
- Leetcode - Pointers/Array - Two sum
- [LeetCode] Two Sum
- Java 哈希表运用-LeetCode 1 Two Sum
- 1_Two Sum --LeetCode
- LeetCode_1_Two Sum
- LeetCode 1:two sum