feat: add solutions to lc problems: No.1424,1425

* No.1424.Diagonal Traverse II
* No.1425.Constrained Subsequence Sum

Author: yanglbme

solution/1400-1499/1424.Diagonal Traverse II/README.md

@@ -77,9 +77,9 @@ tags:
 -   下一条对角线的 $i + j$ 的值比前一条对角线的大；
 -   在同一条对角线中的 $i + j$ 是相同的，而 $j$ 值是从小到大递增。
 
-因此，我们将所有数字以 `(i + j, j, nums[i][j])` 的形式存进 `arr`，然后按照前两项排序。最后返回 `arr` 所有元素第二项组成的数组即可。
+因此，我们将所有数字以 $(i, j, \textit{nums}[i][j])$ 的形式存进 $\textit{arr}$，然后按照前两项排序。最后返回 $\textit{arr}$ 所有元素下标为 $2$ 的值组成的数组即可。
 
-时间复杂度 $O(n\log n)$，其中 $n$ 是 `nums` 数组元素的个数。
+时间复杂度 $O(n \times \log n)$，其中 $n$ 是数组 $\textit{nums}$ 中元素的个数。空间复杂度 $O(n)$。
 
 <!-- tabs:start -->
 
@@ -163,6 +163,21 @@ func findDiagonalOrder(nums [][]int) []int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function findDiagonalOrder(nums: number[][]): number[] {
+    const arr: number[][] = [];
+    for (let i = 0; i < nums.length; ++i) {
+        for (let j = 0; j < nums[i].length; ++j) {
+            arr.push([i + j, j, nums[i][j]]);
+        }
+    }
+    arr.sort((a, b) => (a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]));
+    return arr.map(x => x[2]);
+}
+```
+
 #### C#
 
 ```cs

solution/1400-1499/1424.Diagonal Traverse II/README_EN.md

@@ -53,7 +53,17 @@ tags:
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Sorting
+
+We observe that:
+
+-   The value of $i + j$ is the same for each diagonal;
+-   The value of $i + j$ for the next diagonal is greater than that of the previous diagonal;
+-   Within the same diagonal, the value of $i + j$ is the same, and the value of $j$ increases from small to large.
+
+Therefore, we store all numbers in the form of $(i, j, \textit{nums}[i][j])$ into $\textit{arr}$, and then sort according to the first two items. Finally, return the array composed of the values at index 2 of all elements in $\textit{arr}$.
+
+The time complexity is $O(n \times \log n)$, where $n$ is the number of elements in the array $\textit{nums}$. The space complexity is $O(n)$.
 
 <!-- tabs:start -->
 
@@ -137,6 +147,21 @@ func findDiagonalOrder(nums [][]int) []int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function findDiagonalOrder(nums: number[][]): number[] {
+    const arr: number[][] = [];
+    for (let i = 0; i < nums.length; ++i) {
+        for (let j = 0; j < nums[i].length; ++j) {
+            arr.push([i + j, j, nums[i][j]]);
+        }
+    }
+    arr.sort((a, b) => (a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]));
+    return arr.map(x => x[2]);
+}
+```
+
 #### C#
 
 ```cs

solution/1400-1499/1424.Diagonal Traverse II/Solution.ts

@@ -0,0 +1,10 @@
+function findDiagonalOrder(nums: number[][]): number[] {
+    const arr: number[][] = [];
+    for (let i = 0; i < nums.length; ++i) {
+        for (let j = 0; j < nums[i].length; ++j) {
+            arr.push([i + j, j, nums[i][j]]);
+        }
+    }
+    arr.sort((a, b) => (a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]));
+    return arr.map(x => x[2]);
+}