力扣42题接雨水问题

最新推荐文章于 2024-11-01 15:19:21 发布

Chaoying.

最新推荐文章于 2024-11-01 15:19:21 发布

阅读量162

点赞数

文章标签： leetcode 算法 c++ 数据结构

本文链接：https://blog.csdn.net/TJLCY/article/details/129539339

版权

文章提供了两种C++实现方法来解决力扣第42题——接雨水问题。第一种方法通过两层循环计算每个位置能接的雨水量。第二种方法优化了第一种，预先计算左右两侧的最大高度，提高了效率。两种方法都通过比较当前位置高度与两侧最大高度的较小值来确定可接雨水量。

摘要由CSDN通过智能技术生成

力扣42题接雨水问题

问题描述

方法1

#include <iostream>
#include <vector>
using namespace std;

int fillRainWater(const vector<int> &heights)
{
    int water = 0;
    int n = heights.size();
    if (n <= 2)
    {
        return 0;
    }
    for (int i = 1; i < n - 1; i++)
    {
        int height = heights[i];
        int lmax = 0;
        int rmax = 0;
        for (int j = 0; j < i; j++)
        {
            lmax = heights[j] >= lmax ? heights[j] : lmax;
        }
        for (int k = i + 1; k < n; k++)
        {
            rmax = heights[k] > rmax ? heights[k] : rmax;
        }
        if (height < rmax && height < lmax)
        {
            water += (min(lmax, rmax) - height);
        }
    }
    return water;
}

int main()
{
    int heights[] = {4, 2, 0, 3, 2, 5};
    vector<int> hs;
    for (int i = 0; i < sizeof(heights) / sizeof(heights[0]); i++)
    {
        hs.push_back(heights[i]);
    }
    int water = fillRainWater(hs);
    cout << "能够接到的雨水总量为：" << water << endl;
    system("pause");
    return 0;
}

方法2

#include <iostream>
#include <vector>
using namespace std;

int fillRainWater(const vector<int> &heights)
{
    int n = heights.size();
    // 左侧最大值
    int lmax = 0;
    vector<int> lmaxs;
    lmaxs.reserve(n);
    lmaxs[0] = lmax;
    for (int i = 0; i < n - 1; i++)
    {
        lmax = heights[i] >= lmax ? heights[i] : lmax;
        lmaxs[i + 1] = lmax;
    }
    // 右侧最大值
    int rmax = 0;
    vector<int> rmaxs;
    rmaxs.reserve(n);
    rmaxs[n - 1] = rmax;
    for (int i = n - 1; i > 0; i--)
    {
        rmax = heights[i] >= rmax ? heights[i] : rmax;
        rmaxs[i - 1] = rmax;
    }
    // 雨水总数
    int water = 0;
    for (int i = 1; i < n - 1;i++)
    {
        int h = heights[i];
        lmax = lmaxs[i];
        rmax = rmaxs[i];
        if(lmax > h && rmax > h )
        {
            water += min(lmax, rmax) - h;
        }
    }
    return water;
}

int main()
{
    int heights[] = {4, 2, 0, 3, 2, 5};
    vector<int> hs;
    for (int i = 0; i < sizeof(heights) / sizeof(heights[0]); i++)
    {
        hs.push_back(heights[i]);
    }
    int water = fillRainWater(hs);
    cout << "能够接到的雨水总量为：" << water << endl;
    system("pause");
    return 0;
}