leetcode #1 two sum
2015-04-16 20:17
246 查看
不解的是为什么sort不能使用非静态类内成员函数- -
#include<iostream>#include<vector>#include<iterator>#include<algorithm>using namespace std;class Solution {public: static bool cmp(pair<int,int> &p1,pair<int,int> &p2){ return p1.first<p2.first;} vector<int> twoSum(vector<int> &numbers, int target) { vector<pair<int,int>> m; vector<int> result; for(decltype(numbers.size()) i=0;i<numbers.size();++i) m.push_back(make_pair(numbers[i],i)); std::sort(m.begin(),m.end(),cmp); auto i=m.begin(); auto j=m.end(); --j; while(i!=j){ if(i->first+j->first > target) --j; else if(i->first+j->first < target) ++i; else break; } if(i->second < j->second){ result.push_back(i->second+1); result.push_back(j->second+1);} else { result.push_back(j->second+1); result.push_back(i->second+1); } return result; } };
相关文章推荐
- Leetcode #1 Two Sum 解题小结
- Two Sum--leetcode
- Two Sum
- leetcode_two sum()
- LeetCode 1. Two Sum
- Leetcode-1:Two Sum
- LeetCode之1.Two Sum
- Two Sum
- LeetCode:Two Sum
- LeetCode--Two Sum
- Two Sum
- leetcode------第一题 Two Sum
- LeetCode #75 - Sort Colors
- Two Sum 从数组中找到两个位置的值相加和为给定目标的值
- LeetCode 1. Two Sum
- leetcode problem solve 1——Two Sum
- LeetCode小白菜笔记[1]:Two Sum
- 1. Two Sum
- Two Sum - Data structure design
- LeetCode_1_Two Sum