feat: add 1422,1637

Author: BaffinLee

1401-1500/1422. Maximum Score After Splitting a String.md

@@ -0,0 +1,84 @@
+# 1422. Maximum Score After Splitting a String
+
+- Difficulty: Easy.
+- Related Topics: String.
+- Similar Questions: .
+
+## Problem
+
+Given a string `s` of zeros and ones, **return the maximum score after splitting the string into two **non-empty** substrings** (i.e. **left** substring and **right** substring).
+
+The score after splitting a string is the number of **zeros** in the **left** substring plus the number of **ones** in the **right** substring.
+
+ 
+Example 1:
+
+```
+Input: s = "011101"
+Output: 5 
+Explanation: 
+All possible ways of splitting s into two non-empty substrings are:
+left = "0" and right = "11101", score = 1 + 4 = 5 
+left = "01" and right = "1101", score = 1 + 3 = 4 
+left = "011" and right = "101", score = 1 + 2 = 3 
+left = "0111" and right = "01", score = 1 + 1 = 2 
+left = "01110" and right = "1", score = 2 + 1 = 3
+```
+
+Example 2:
+
+```
+Input: s = "00111"
+Output: 5
+Explanation: When left = "00" and right = "111", we get the maximum score = 2 + 3 = 5
+```
+
+Example 3:
+
+```
+Input: s = "1111"
+Output: 3
+```
+
+ 
+**Constraints:**
+
+
+	
+- `2 <= s.length <= 500`
+	
+- The string `s` consists of characters `'0'` and `'1'` only.
+
+
+
+## Solution
+
+```javascript
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var maxScore = function(s) {
+    var numOfOnes = 0;
+    var numOfZeros = 0;
+    var max = 0;
+    for (var i = 0; i < s.length; i++) {
+        s[i] === '1' && numOfOnes++;
+    }
+    for (var j = 0; j < s.length - 1; j++) {
+        s[j] === '0' && numOfZeros++;
+        s[j] === '1' && numOfOnes--;
+        max = Math.max(numOfOnes + numOfZeros, max);
+    }
+    return max;
+};
+```
+
+**Explain:**
+
+nope.
+
+**Complexity:**
+
+* Time complexity : O(n).
+* Space complexity : O(0).

1601-1700/1637. Widest Vertical Area Between Two Points Containing No Points.md

@@ -0,0 +1,72 @@
+# 1637. Widest Vertical Area Between Two Points Containing No Points
+
+- Difficulty: Medium.
+- Related Topics: Array, Sorting.
+- Similar Questions: .
+
+## Problem
+
+Given `n` `points` on a 2D plane where `points[i] = [xi, yi]`, Return** the **widest vertical area** between two points such that no points are inside the area.**
+
+A **vertical area** is an area of fixed-width extending infinitely along the y-axis (i.e., infinite height). The **widest vertical area** is the one with the maximum width.
+
+Note that points **on the edge** of a vertical area **are not** considered included in the area.
+
+ 
+Example 1:
+
+![](https://assets.leetcode.com/uploads/2020/09/19/points3.png)
+​
+```
+Input: points = [[8,7],[9,9],[7,4],[9,7]]
+Output: 1
+Explanation: Both the red and the blue area are optimal.
+```
+
+Example 2:
+
+```
+Input: points = [[3,1],[9,0],[1,0],[1,4],[5,3],[8,8]]
+Output: 3
+```
+
+ 
+**Constraints:**
+
+
+	
+- `n == points.length`
+	
+- `2 <= n <= 105`
+	
+- `points[i].length == 2`
+	
+- `0 <= xi, yi <= 109`
+
+
+
+## Solution
+
+```javascript
+/**
+ * @param {number[][]} points
+ * @return {number}
+ */
+var maxWidthOfVerticalArea = function(points) {
+    var maxGap = 0;
+    points.sort((a, b) => a[0] - b[0]);
+    for (var i = 1; i < points.length; i++) {
+        maxGap = Math.max(maxGap, points[i][0] - points[i - 1][0]);
+    }
+    return maxGap;
+};
+```
+
+**Explain:**
+
+nope.
+
+**Complexity:**
+
+* Time complexity : O(n).
+* Space complexity : O(1).