Add leetcode problem 2311 python version

Author: lht102

leetcode/src/02311_longest_binary_subsequence_less_than_or_equal_to_k/__init__.py

@@ -0,0 +1,13 @@
+class Solution:
+    def longestSubsequence(self, s: str, k: int) -> int:
+        cur_sum = 0
+        res = 0
+        bit_len = k.bit_length()
+        for i, ch in enumerate(s[::-1]):
+            if ch == "1":
+                if i < bit_len and (1 << i) + cur_sum <= k:
+                    cur_sum += 1 << i
+                    res += 1
+            else:
+                res += 1
+        return res

leetcode/src/02311_longest_binary_subsequence_less_than_or_equal_to_k/solution.py

@@ -0,0 +1,20 @@
+import unittest
+from .solution import Solution
+
+
+class TestSolution(unittest.TestCase):
+    def test_longestSubsequence(self):
+        s = Solution()
+        self.assertEqual(s.longestSubsequence("1001010", 5), 5)
+        self.assertEqual(s.longestSubsequence("00101001", 1), 6)
+        self.assertEqual(
+            s.longestSubsequence(
+                "111100010000011101001110001111000000001011101111111110111000011111011000010101110100110110001111001001011001010011010000011111101001101000000101101001110110000111101011000101",
+                11713332,
+            ),
+            96,
+        )
+
+
+if __name__ == "__main__":
+    unittest.main()