feat: add ts solutions to lcp problems: No.11,12 (doocs#1756)

* LCP 11.期望个数统计
* LCP 12.小张刷题计划

Author: yanglbme

lcp/LCP 11. 期望个数统计/README.md

@@ -111,6 +111,15 @@ func expectNumber(scores []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function expectNumber(scores: number[]): number {
+    const s: Set<number> = new Set<number>(scores);
+    return s.size;
+}
+```
+
 ### **...**
 
 ```

lcp/LCP 11. 期望个数统计/Solution.ts

@@ -0,0 +1,4 @@
+function expectNumber(scores: number[]): number {
+    const s: Set<number> = new Set<number>(scores);
+    return s.size;
+}

lcp/LCP 12. 小张刷题计划/README.md

@@ -186,6 +186,39 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minTime(time: number[], m: number): number {
+    let left = 0;
+    let right = time.reduce((a, b) => a + b);
+    const check = (t: number): boolean => {
+        let s = 0;
+        let mx = 0;
+        let d = 1;
+        for (const x of time) {
+            s += x;
+            mx = Math.max(mx, x);
+            if (s - mx > t) {
+                s = x;
+                mx = x;
+                d++;
+            }
+        }
+        return d <= m;
+    };
+    while (left < right) {
+        const mid = (left + right) >> 1;
+        if (check(mid)) {
+            right = mid;
+        } else {
+            left = mid + 1;
+        }
+    }
+    return left;
+}
+```
+
 ### **...**
 
 ```

lcp/LCP 12. 小张刷题计划/Solution.ts

@@ -0,0 +1,28 @@
+function minTime(time: number[], m: number): number {
+    let left = 0;
+    let right = time.reduce((a, b) => a + b);
+    const check = (t: number): boolean => {
+        let s = 0;
+        let mx = 0;
+        let d = 1;
+        for (const x of time) {
+            s += x;
+            mx = Math.max(mx, x);
+            if (s - mx > t) {
+                s = x;
+                mx = x;
+                d++;
+            }
+        }
+        return d <= m;
+    };
+    while (left < right) {
+        const mid = (left + right) >> 1;
+        if (check(mid)) {
+            right = mid;
+        } else {
+            left = mid + 1;
+        }
+    }
+    return left;
+}