From b179bcedd8096ded9576458006ff92985c5d11a0 Mon Sep 17 00:00:00 2001
From: Felix <44283564+Felixgitcode@users.noreply.github.com>
Date: Mon, 26 Nov 2018 17:22:42 +0800
Subject: [PATCH] Create Felix.md

---
 2019.11.25-leetcode80/Felix.md | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 2019.11.25-leetcode80/Felix.md

diff --git a/2019.11.25-leetcode80/Felix.md b/2019.11.25-leetcode80/Felix.md
new file mode 100644
index 000000000..c05e91b95
--- /dev/null
+++ b/2019.11.25-leetcode80/Felix.md
@@ -0,0 +1,30 @@
+```javascript
+package leetcode.medium;
+/**
+ * @author Felix
+ * @date 2018年10月31日下午9:59:27
+   @version 给定 n 个非负整数 a1，a2，...，an，每个数代表坐标中的一个点 (i, ai) 。在坐标内画 n 条垂直线，垂直线 i 的两个端点分别为 
+   (i, ai) 和 (i, 0)。找出其中的两条线，使得它们与 x 轴共同构成的容器可以容纳最多的水。说明：你不能倾斜容器，且 n 的值至少为 2。
+ */
+public class MaxArea {
+	public int maxArea(int[] height){
+		int len = height.length;
+		int max = 0,low = 0,high = len - 1;
+		while(low < high){
+			int lowMax = height[low],highMax = height[high];
+			int water = (high - low) * (lowMax < highMax ? lowMax : highMax);
+			max = water > max ? water : max;
+			
+			if(height[low] <= height[high]){
+				while(low < high && height[low] <= lowMax)
+					low++;
+			}else{
+				while(high > low && height[high] <= highMax)
+					high--;
+			}
+		}
+		
+		return max;
+	}
+}
+```