# LWC 56：717. 1-bit and 2-bit Characters

## LWC 56：717. 1-bit and 2-bit Characters

Problem:

We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11). Now given a string represented by several bits. Return whether the last character must be a one-bit character or not. The given string will always end with a zero.

Example 1:

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.

Example 2:

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.

Note:

1 <= len(bits) <= 1000.

bits[i] is always 0 or 1.

```    public boolean isOneBitCharacter(int[] bits) {
int n = bits.length;
int i = 0;
for (; i < n - 1;) {
if (bits[i] == 1) {
i += 2;
}
else {
i += 1;
}
}
return i == n - 1;
}   ```

0 条评论

## 相关文章

### 高通msm8909耳机调试

1、DTS相应修改： DTS相关代码：kernel/arch/arm/boot/dts/qcom/msm8909-qrd-skuc.dtsi： 1 s...

8105

### 简练的视图模型 ViewModel

patterns & practices Developer Center 发布了 Unity Application Block 1.2 for Silver...

2349

### java.base.jmod

/Library/Java/JavaVirtualMachines/jdk-9.jdk/Contents/Home/jmods\$ jmod list java....

1182

2608

1423

4535

### echarts太阳分布图-饼图来回穿梭

var dom = document.getElementById("container");

1442

### c# 使用timer定时器操作,上次定时到了以后,下次还未执行完怎么处理

------解决方案-------------------------------------------------------- 开始的时候，禁用定时器，你...

3061

2142

2762