Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 717 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 717 # by problem number
lcpy gen -s one_bit_and_two_bit_characters # by problem name
0.10 or 11).bits that ends with 0, return true if the last character must be a one-bit character.
Input: bits = [1,0,0]
Output: true
Explanation: The only way to decode it is two-bit character and one-bit character.
So the last character is one-bit character.
Input: bits = [1,1,1,0]
Output: false
Explanation: The only way to decode it is two-bit character and two-bit character.
So the last character is not one-bit character.
class Solution:
# Time: O(n)
# Space: O(1)
def is_one_bit_character(self, bits: list[int]) -> bool:
ones = 0
for bit in reversed(bits[:-1]):
if bit == 0:
break
ones += 1
return ones % 2 == 0
| Time | Space |
|---|---|
| O(n) | O(1) |