feat: add typescript solution to locf problem: No.04. Find Number In 2D Array (#422)

Author: zhaocchen

lcof/面试题04. 二维数组中的查找/README.md

@@ -148,6 +148,26 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+function findNumberIn2DArray(matrix: number[][], target: number): boolean {
+    let m: number = matrix.length, n: number;
+    if (!matrix || !m || !matrix[0] || !(n = matrix[0].length)) return false;
+    let i: number = 0, j: number = n - 1;
+    while (i < m && j >= 0) {
+        let cur: number = matrix[i][j];
+        if (cur == target) return true;
+        if (cur > target) {
+            j--;
+        } else {
+            i++;
+        }
+    }
+    return false;
+};
+```
+
 ### **...**
 
 ```

lcof/面试题04. 二维数组中的查找/Solution.ts

@@ -0,0 +1,15 @@
+function findNumberIn2DArray(matrix: number[][], target: number): boolean {
+    let m: number = matrix.length, n: number;
+    if (!matrix || !m || !matrix[0] || !(n = matrix[0].length)) return false;
+    let i: number = 0, j: number = n - 1;
+    while (i < m && j >= 0) {
+        let cur: number = matrix[i][j];
+        if (cur == target) return true;
+        if (cur > target) {
+            j--;
+        } else {
+            i++;
+        }
+    }
+    return false;
+};