diff options
author | terminaldweller <thabogre@gmail.com> | 2022-04-06 12:56:41 +0000 |
---|---|---|
committer | terminaldweller <thabogre@gmail.com> | 2022-04-06 12:56:41 +0000 |
commit | 50dcc51aa192049484e4aaf8b260e8d900ec520d (patch) | |
tree | df4e907ad836a18b496c66a1e6cd6cd4e086a8cd /11/main.cpp | |
parent | update (diff) | |
download | leetcode-50dcc51aa192049484e4aaf8b260e8d900ec520d.tar.gz leetcode-50dcc51aa192049484e4aaf8b260e8d900ec520d.zip |
update
Diffstat (limited to '')
-rw-r--r-- | 11/main.cpp | 44 |
1 files changed, 44 insertions, 0 deletions
diff --git a/11/main.cpp b/11/main.cpp new file mode 100644 index 0000000..4cec006 --- /dev/null +++ b/11/main.cpp @@ -0,0 +1,44 @@ + +#include "header.hpp" +#include <cmath> + +class Solution { +public: + static int maxArea(std::vector<int> &height) { + int maxarea = 0, l = 0, r = height.size() - 1; + while (l < r) { + maxarea = std::max(maxarea, std::min(height[l], height[r]) * (r - l)); + if (height[l] < height[r]) + l++; + else + r--; + } + return maxarea; + } +}; + +int main(int argc, char **argv) { + std::vector<int> height = {1, 8, 6, 2, 5, 4, 8, 3, 7}; + std::vector<int> height2 = { + 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, + 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, + 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, + 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, + 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, + 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, + 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, + 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, + 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, + 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, + 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, + 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, + 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, + 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, + 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, + 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, + 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, + 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, + 270, 271, 272, 273, 274, 275, 276, 2}; + std::cout << Solution::maxArea(height2); + return 0; +} |