Add solution #717

Author: JoshCrozier

README.md

@@ -324,6 +324,7 @@
 705|[Design HashSet](./0705-design-hashset.js)|Easy|
 706|[Design HashMap](./0706-design-hashmap.js)|Easy|
 713|[Subarray Product Less Than K](./0713-subarray-product-less-than-k.js)|Medium|
+717|[1-bit and 2-bit Characters](./0717-1-bit-and-2-bit-characters.js)|Easy|
 720|[Longest Word in Dictionary](./0720-longest-word-in-dictionary.js)|Medium|
 722|[Remove Comments](./0722-remove-comments.js)|Medium|
 724|[Find Pivot Index](./0724-find-pivot-index.js)|Easy|

solutions/0717-1-bit-and-2-bit-characters.js

@@ -0,0 +1,20 @@
+/**
+ * 717. 1-bit and 2-bit Characters
+ * https://leetcode.com/problems/1-bit-and-2-bit-characters/
+ * Difficulty: Easy
+ *
+ * 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).
+ *
+ * Given a binary array bits that ends with 0, return true if the last character
+ * must be a one-bit character.
+ */
+
+/**
+ * @param {number[]} bits
+ * @return {boolean}
+ */
+var isOneBitCharacter = function(bits) {
+  return bits.slice(0, bits.length - 1).join('').replace(/11|10|0/g, '') !== '1';
+};