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

最新推荐文章于 2025-08-21 20:43:22 发布

Snail_Walker

最新推荐文章于 2025-08-21 20:43:22 发布

阅读量309

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 文章标签： leetcode 167 122 twosum seelsto

本文链接：https://blog.youkuaiyun.com/c602273091/article/details/54798755

Leetcode 专栏收录该内容

175 篇文章

订阅专栏

本文解析了两道经典的算法题目：TwoSumII-Inputarrayissorted和BestTimetoBuyandSellStockII。针对TwoSumII-Inputarrayissorted问题，采用双指针法在已排序的数组中寻找两个数使得它们的和为目标值；对于BestTimetoBuyandSellStockII问题，则提出了一种贪心算法来确定最佳买卖时机以获取最大利润。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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;
    }
};