您的位置:首页 > 其它

167. Two Sum II - Input array is sorted \ 122. Best Time to Buy and Sell Stock II

2017-01-31 09:10 337 查看
Two Sum II - Input array is sorted

Best Time to Buy and Sell Stock II

167. Two Sum II - Input array is sorted

class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int right = numbers.size() - 1;
int left = 0;
vector<int> result;
int sum = numbers[left] + numbers[right];

while(sum != target) {
if(sum < target) left++;
else right--;

sum = numbers[left] + numbers[right];
}

result.push_back(left+1);
result.push_back(right+1);

return result;
}
};


122. Best Time to Buy and Sell Stock II

class Solution {
public:
int maxProfit(vector<int>& prices) {
int prfit = 0;
int p_len = prices.size() - 1;
int stt = p_len >= 0 ? prices[0]:0;

for(int i = 1; i <= p_len; i++) {
int var = prices[i] - stt;
if(var > 0)   prfit += var;
stt = prices[i];
}

return prfit;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode 167 122 twosum seelsto