feat: add typescript solution to lc problem: No.2311

No.2311.Longest Binary Subsequence Less Than or Equal to K

Author: zhaocchen

solution/2300-2399/2311.Longest Binary Subsequence Less Than or Equal to K/README.md

@@ -158,7 +158,16 @@ func longestSubsequence(s string, k int) int {
 ### **TypeScript**
 
 ```ts
-
+function longestSubsequence(s: string, k: number): number {
+    let numStr = '';
+    const n = s.length, m = s.split('').reduce((a, c) => a + Number(c), 0);
+    for (let i = n - 1; i >= 0; i--) {
+        const cur = s.charAt(i).concat(numStr);
+        if (parseInt(cur, 2) > k) break;
+        numStr = cur;
+    }
+    return n - m + numStr.split('').reduce((a, c) => a + Number(c), 0);
+};
 ```
 
 ### **...**

solution/2300-2399/2311.Longest Binary Subsequence Less Than or Equal to K/README_EN.md

@@ -144,7 +144,16 @@ func longestSubsequence(s string, k int) int {
 ### **TypeScript**
 
 ```ts
-
+function longestSubsequence(s: string, k: number): number {
+    let numStr = '';
+    const n = s.length, m = s.split('').reduce((a, c) => a + Number(c), 0);
+    for (let i = n - 1; i >= 0; i--) {
+        const cur = s.charAt(i).concat(numStr);
+        if (parseInt(cur, 2) > k) break;
+        numStr = cur;
+    }
+    return n - m + numStr.split('').reduce((a, c) => a + Number(c), 0);
+};
 ```
 
 ### **...**

solution/2300-2399/2311.Longest Binary Subsequence Less Than or Equal to K/Solution.ts

@@ -0,0 +1,10 @@
+function longestSubsequence(s: string, k: number): number {
+    let numStr = '';
+    const n = s.length, m = s.split('').reduce((a, c) => a + Number(c), 0);
+    for (let i = n - 1; i >= 0; i--) {
+        const cur = s.charAt(i).concat(numStr);
+        if (parseInt(cur, 2) > k) break;
+        numStr = cur;
+    }
+    return n - m + numStr.split('').reduce((a, c) => a + Number(c), 0);
+};