feat: add the solution of 1-bit and 2-bit Characters(717) with Java.

Author: Mukyu

README.md

@@ -79,7 +79,7 @@
 | [695][695-question] | [Max Area of Island][695-tips]                               | [✅][695-java] | [✅][695-js] |                  |
 | [696][696-question] | [Count Binary Substrings][696-tips]                          | [✅][696-java] | [✅][696-js] |                  |
 | [697][697-question] | [Degree of an Array][697-tips]                               | [✅][697-java] | [✅][697-js] |                  |
-| [717][717-question] | [1-bit and 2-bit Characters][717-tips]                       |                | [✅][717-js] |                  |
+| [717][717-question] | [1-bit and 2-bit Characters][717-tips]                       | [✅][717-java] | [✅][717-js] |                  |
 | [720][720-question] | [Longest Word in Dictionary][720-tips]                       |                | [✅][720-js] |                  |
 | [724][724-question] | [Find Pivot Index][724-tips]                                 |                | [✅][724-js] |                  |
 | [728][728-question] | [Self Dividing Numbers][728-tips]                            | [✅][728-java] | [✅][728-js] |                  |
@@ -477,6 +477,7 @@
 [695-java]: ./src/_695/Solution.java
 [696-java]: ./src/_696/Solution.java
 [697-java]: ./src/_697/Solution.java
+[717-java]: ./src/_717/Solution.java
 [728-java]: ./src/_728/Solution.java
 [771-java]: ./src/_771/Solution.java
 [804-java]: ./src/_804/Solution.java

src/_717/Solution.java

@@ -0,0 +1,15 @@
+package _717;
+
+public class Solution {
+    public boolean isOneBitCharacter(int[] bits) {
+        int i = bits.length - 2;
+        while (i >= 0 && bits[i] != 0) i--;
+        return ((bits.length - i) & 1) == 0;
+    }
+
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        System.out.println(solution.isOneBitCharacter(new int[]{1, 1, 0}));
+        System.out.println(solution.isOneBitCharacter(new int[]{1, 1, 1, 0}));
+    }
+}

tips/717/README.md

@@ -1,46 +1,72 @@
-[xxxx][title]
+[1-bit and 2-bit Characters][title]
 
 ## Description
-// 抄题目
 
+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`).
 
-**Example:**
+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:**
 
 ```
-// 抄Example
+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:**
-// Note
 
-**Tags:** // tags
+`1 <= len(bits) <= 1000`.
+
+`bits[i]` is always `0` or `1`.
 
+**Tags:** [Array](https://leetcode.com/tag/array/)
 
 ## 思路 1
-// 贴一些关键代码,说一些解题思路
-// (同一种语言可以写多种思路，与某种语言思路相同的另一种语言的思路无须赘述，但可以把代码贴在后面) 
-```java
 
-```
-```javascript
+观察可以发现，其实每个编码数组都只有一种解码方式，可以直接从头开始解码。
+
+**Java:**
 
+```java
+public boolean isOneBitCharacter(int[] bits) {
+    int i = 0;
+    while (i < bits.length - 1) {
+        i += bits[i] + 1;
+    }
+    return i == bits.length - 1;
+}
 ```
 
 ## 思路 2
-// 贴一些关键代码,说一些解题思路
-```java
 
-```
+再观察我们可以发现，`0`肯定是一个字符编码的结尾。且题目指出所给的编码数组的最后一个编码肯定为`0`，那么我们只要找到倒数第二个`0`的位置即可，因为这两个`0`之间的`1`的个数为偶数个时，当且仅当最后一个字符的编码为一个单独的`0`。
 
-## 思路 3
-// 贴一些关键代码,说一些解题思路
-```kotlin
+**Java:**
 
+```java
+public boolean isOneBitCharacter(int[] bits) {
+    int i = bits.length - 2;
+    while (i >= 0 && bits[i] != 0) i--;
+    return ((bits.length - i) & 1) == 0;
+}
 ```
 
 ## 结语
-   
+
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]
 
-[title]: https://leetcode.com/problems/xxxx
+[title]: https://leetcode.com/problems/1-bit-and-2-bit-characters/description/
 [ls]: https://github.com/RichCodersAndMe/LeetCode-Solution