feat: add ts solution to lc problem: No.1846 (#1559)

Author: thinkasany

solution/1800-1899/1846.Maximum Element After Decreasing and Rearranging/README.md

@@ -30,7 +30,7 @@
 <b>输入：</b>arr = [2,2,1,2,1]
 <b>输出：</b>2
 <b>解释：</b>
-我们可以重新排列 arr 得到 <code>[1,2,2,2,1] ，该数组满足所有条件。</code>
+我们可以重新排列 arr 得到 [1,2,2,2,1] ，该数组满足所有条件。
 arr 中最大元素为 2 。
 </pre>
 
@@ -41,10 +41,10 @@ arr 中最大元素为 2 。
 <b>输出：</b>3
 <b>解释：</b>
 一个可行的方案如下：
-1. 重新排列 <code>arr</code> 得到 <code>[1,100,1000] 。</code>
+1. 重新排列 arr< 得到 [1,100,1000] 。
 2. 将第二个元素减小为 2 。
 3. 将第三个元素减小为 3 。
-现在 <code>arr = [1,2,3] ，满足所有条件。</code>
+现在 arr = [1,2,3] ，满足所有条件。
 arr 中最大元素为 3 。
 </pre>
 
@@ -150,6 +150,22 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maximumElementAfterDecrementingAndRearranging(arr: number[]): number {
+    arr.sort((a, b) => a - b);
+    arr[0] = 1;
+    let ans = 1;
+    for (let i = 1; i < arr.length; ++i) {
+        const d = Math.max(0, arr[i] - arr[i - 1] - 1);
+        arr[i] -= d;
+        ans = Math.max(ans, arr[i]);
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/1800-1899/1846.Maximum Element After Decreasing and Rearranging/README_EN.md

@@ -27,8 +27,8 @@
 <strong>Input:</strong> arr = [2,2,1,2,1]
 <strong>Output:</strong> 2
 <strong>Explanation:</strong> 
-We can satisfy the conditions by rearranging <code>arr</code> so it becomes <code>[1,2,2,2,1]</code>.
-The largest element in <code>arr</code> is 2.
+We can satisfy the conditions by rearranging arr so it becomes [1,2,2,2,1].
+The largest element in arr is 2.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -38,11 +38,11 @@ The largest element in <code>arr</code> is 2.
 <strong>Output:</strong> 3
 <strong>Explanation:</strong> 
 One possible way to satisfy the conditions is by doing the following:
-1. Rearrange <code>arr</code> so it becomes <code>[1,100,1000]</code>.
+1. Rearrange arr so it becomes [1,100,1000].
 2. Decrease the value of the second element to 2.
 3. Decrease the value of the third element to 3.
-Now <code>arr = [1,2,3], which </code>satisfies the conditions.
-The largest element in <code>arr is 3.</code>
+Now arr = [1,2,3], which satisfies the conditions.
+The largest element in arr is 3.
 </pre>
 
 <p><strong class="example">Example 3:</strong></p>
@@ -138,6 +138,22 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maximumElementAfterDecrementingAndRearranging(arr: number[]): number {
+    arr.sort((a, b) => a - b);
+    arr[0] = 1;
+    let ans = 1;
+    for (let i = 1; i < arr.length; ++i) {
+        const d = Math.max(0, arr[i] - arr[i - 1] - 1);
+        arr[i] -= d;
+        ans = Math.max(ans, arr[i]);
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/1800-1899/1846.Maximum Element After Decreasing and Rearranging/Solution.ts

@@ -0,0 +1,11 @@
+function maximumElementAfterDecrementingAndRearranging(arr: number[]): number {
+    arr.sort((a, b) => a - b);
+    arr[0] = 1;
+    let ans = 1;
+    for (let i = 1; i < arr.length; ++i) {
+        const d = Math.max(0, arr[i] - arr[i - 1] - 1);
+        arr[i] -= d;
+        ans = Math.max(ans, arr[i]);
+    }
+    return ans;
+};

solution/config.py

@@ -69,6 +69,7 @@
     1754,
     1760,
     1797,
+    1846,
     1850,
     1891,
     1899,