Datawhale-LeetCode编程实践组队学习Task03

11. 盛最多水的容器

class Solution {
public:
    int maxArea(vector<int>& height) {
        int n = height.size();
        int left = 0;
        int right = n - 1;
        int ans = INT_MIN;
        while (left <= right)
        {
            ans = max(ans, (right - left) * min(height[left], height[right]));
            if (height[left] < height[right])
            {
                left++;
            }
            else
            {
                right--;
            }
        }

        return ans;
    }
};

14. 最长公共前缀

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        int maxlen = 0;
        for (string str : strs)
            maxlen = max((int)str.length(), maxlen);
        int n = strs.size();
        int len = 1;
        for (; len <= maxlen; len++)
        {
            int i = 1;
            while (i < n && strs[i][len - 1] == strs[0][len - 1]) i++;
            if (i < n) break;
        }

        return maxlen == 0 ? "" : strs[0].substr(0, len - 1);
    }
};

15. 三数之和

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        int n = nums.size();
        sort(nums.begin(), nums.end());
        vector<vector<int>> ans;
        for (int first = 0; first < n; ++first) {
            if (first > 0 && nums[first] == nums[first - 1]) {
                continue;
            }
            int third = n - 1;
            int target = -nums[first];
            for (int second = first + 1; second < n; ++second) {
                if (second > first + 1 && nums[second] == nums[second - 1]) {
                    continue;
                }
                while (second < third && nums[second] + nums[third] > target) {
                    --third;
                }
                if (second == third) {
                    break;
                }
                if (nums[second] + nums[third] == target) {
                    ans.push_back({nums[first], nums[second], nums[third]});
                }
            }
        }
        return ans;
    }
};