您的位置:首页 > 其它

LeetCode-Two Sum

2015-11-28 18:39 302 查看
         一直在写LeetCode,现在也是把以前拿C++写过的题传上来,供大家参考。

原题链接:点击打开链接

class Solution
{
public:
vector<int> twoSum(vector<int>& numbers, int target)
{
vector<int> tmpNumbers(numbers.begin(), numbers.end());
sort(tmpNumbers.begin(), tmpNumbers.end());

int val1 = -1;
int val2 = -1;
int i = 0;
int j = tmpNumbers.size() - 1;
// find two numbers added equals to target
while(i < j)
{
if((tmpNumbers[i] + tmpNumbers[j]) < target)
{
i++;
}
else if((tmpNumbers[i] + tmpNumbers[j]) > target)
{
j--;
}
else
{
val1 = tmpNumbers[i];
val2 = tmpNumbers[j];
break;
}
}

vector<int> result;
// find the index of the two numbers
for(int i = 0; i < numbers.size(); i++)
{
if(numbers[i] == val1 || numbers[i] == val2)
{
result.push_back(i + 1);
}
if(2 == result.size())
{
return result;
}
}
return result;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  算法 LeetCode