Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- vector<int> twoSum(vector<int>& numbers, int target) {
- int x;
- int v;
- int ans, i;
- for (i = 0; i < numbers.size(); i++) {
- x = numbers[i];
- v = target - x;
- if (binary_search(numbers.begin(), numbers.end(), v)) {
- ans = lower_bound(numbers.begin(), numbers.end(), v) - numbers.begin();
- if(ans == i) {
- continue;
- }
- break;
- }
- }
- vector<int> res;
- res.push_back(i + 1);
- res.push_back(ans + 1);
- sort(res.begin(), res.end());
- return res;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement