From d8f3b40085619cb680c8f227c65a1f5acc393223 Mon Sep 17 00:00:00 2001
From: crupest <crupest@outlook.com>
Date: Tue, 23 Feb 2021 21:07:19 +0800
Subject: Move leetcode solutions to subdir.

---
 cpp/11.cpp | 42 ------------------------------------------
 1 file changed, 42 deletions(-)
 delete mode 100644 cpp/11.cpp

(limited to 'cpp/11.cpp')

diff --git a/cpp/11.cpp b/cpp/11.cpp
deleted file mode 100644
index 44a8fd9..0000000
--- a/cpp/11.cpp
+++ /dev/null
@@ -1,42 +0,0 @@
-#include <vector>
-#include <algorithm>
-
-using std::vector;
-
-class Solution
-{
-public:
-    int maxArea(vector<int> &height)
-    {
-        auto left = height.cbegin();
-        auto right = height.cend();
-        --right;
-
-        int result = 0;
-
-        // although length could be calculated by right - left,
-        // but this can be cached in register.
-        int length = height.size() - 1;
-
-        while (left != right)
-        {
-            const int left_v = *left;
-            const int right_v = *right;
-            const int capacity = std::min(left_v, right_v) * length;
-            result = std::max(capacity, result);
-
-            if (left_v < right_v)
-            {
-                ++left;
-            }
-            else
-            {
-                --right;
-            }
-
-            length--;
-        }
-
-        return result;
-    }
-};
-- 
cgit v1.2.3