Update Solution.c

Author: yanglbme

solution/0000-0099/0011.Container With Most Water/Solution.c

@@ -1,9 +1,22 @@
-int maxArea(int* h, int n) {
-    int l = 0, r = n - 1, max = 0;
+int min(int a, int b) {
+    return a < b ? a : b;
+}
+
+int max(int a, int b) {
+    return a > b ? a : b;
+}
+
+int maxArea(int* height, int heightSize) {
+    int l = 0, r = heightSize - 1;
+    int ans = 0;
     while (l < r) {
-        int area = (r - l) * (h[l] < h[r] ? h[l++] : h[r--]);
-        if (area > max)
-            max = area;
+        int t = min(height[l], height[r]) * (r - l);
+        ans = max(ans, t);
+        if (height[l] < height[r]) {
+            ++l;
+        } else {
+            --r;
+        }
     }
-    return max;
+    return ans;
 }