Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/d9/d80/trapped__rainwater_8cpp_source.html below:

TheAlgorithms/C++: dynamic_programming/trapped_rainwater.cpp Source File

std::size_t n = heights.size();

std::vector<uint32_t> leftMax(n), rightMax(n);

leftMax[0] = heights[0];

(std::size_t i = 1; i < n; ++i) {

leftMax[i] = std::max(leftMax[i - 1], heights[i]);

rightMax[n - 1] = heights[n - 1];

(std::size_t i = n - 2; i < n; --i) {

rightMax[i] = std::max(rightMax[i + 1], heights[i]);

uint32_t trappedWater = 0;

(std::size_t i = 0; i < n; ++i) {

std::max(0u, std::min(leftMax[i], rightMax[i]) - heights[i]);

std::vector<uint32_t> test_basic = {0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1};

std::vector<uint32_t> test_peak_under_water = {3, 0, 2, 0, 4};

std::vector<uint32_t> test_bucket = {5, 1, 5};

std::vector<uint32_t> test_skewed_bucket = {4, 1, 5};

std::vector<uint32_t> test_empty = {};

std::vector<uint32_t> test_flat = {0, 0, 0, 0, 0};

std::vector<uint32_t> test_no_trapped_water = {1, 1, 2, 4, 0, 0, 0};

std::vector<uint32_t> test_single_elevation = {5};

std::vector<uint32_t> test_two_point_elevation = {5, 1};

std::vector<uint32_t> test_large_elevation_map_difference = {5, 1, 6, 1,

test_large_elevation_map_difference) == 15);

Dynamic Programming algorithms.

uint32_t trappedRainwater(const std::vector< uint32_t > &heights)

Function to calculate the trapped rainwater.

static void test()

Self-test implementations.

int main()

Main function.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4