my commit for issue 174

LeetCode/174-Container-With-Most-Water/Java/Problem.md

@@ -0,0 +1,28 @@
+You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
+
+Find two lines that together with the x-axis form a container, such that the container contains the most water.
+
+Return the maximum amount of water a container can store.
+
+Notice that you may not slant the container.
+
+
+
+Example 1:
+
+
+Input: height = [1,8,6,2,5,4,8,3,7]
+Output: 49
+Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
+Example 2:
+
+Input: height = [1,1]
+Output: 1
+
+
+Constraints:
+
+n == height.length
+2 <= n <= 105
+0 <= height[i] <= 104
+

LeetCode/174-Container-With-Most-Water/Java/Readme.md

@@ -0,0 +1,5 @@
+# How to Run?
+
+1. Go to the leetcode question site. [Link](https://leetcode.com/problems/container-with-most-water/description/)
+2. Copy and paste the code.
+3. Run or Submit to see the result.

LeetCode/174-Container-With-Most-Water/Java/Solution.java

@@ -0,0 +1,17 @@
+class Solution {
+    public int maxArea(int[] height) {
+         int maxarea = 0;
+        int left = 0; 
+        int right = height.length - 1;
+        while (left < right) {
+            int width = right - left;
+            maxarea = Math.max(maxarea, Math.min(height[left], height[right]) * width);
+            if (height[left] <= height[right]) {
+                left++;
+            } else {
+                right--;
+            }
+        }
+        return maxarea;
+    }
+    }