Add solution #1017

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,091 LeetCode solutions in JavaScript
+# 1,092 LeetCode solutions in JavaScript
 
 [https://leetcode.com/](https://leetcode.com/)
 
@@ -825,6 +825,7 @@
 1014|[Best Sightseeing Pair](./solutions/1014-best-sightseeing-pair.js)|Medium|
 1015|[Smallest Integer Divisible by K](./solutions/1015-smallest-integer-divisible-by-k.js)|Medium|
 1016|[Binary String With Substrings Representing 1 To N](./solutions/1016-binary-string-with-substrings-representing-1-to-n.js)|Medium|
+1017|[Convert to Base -2](./solutions/1017-convert-to-base-2.js)|Medium|
 1022|[Sum of Root To Leaf Binary Numbers](./solutions/1022-sum-of-root-to-leaf-binary-numbers.js)|Easy|
 1023|[Camelcase Matching](./solutions/1023-camelcase-matching.js)|Medium|
 1028|[Recover a Tree From Preorder Traversal](./solutions/1028-recover-a-tree-from-preorder-traversal.js)|Hard|

solutions/1017-convert-to-base-2.js

@@ -0,0 +1,28 @@
+/**
+ * 1017. Convert to Base -2
+ * https://leetcode.com/problems/convert-to-base-2/
+ * Difficulty: Medium
+ *
+ * Given an integer n, return a binary string representing its representation in base -2.
+ *
+ * Note that the returned string should not have leading zeros unless the string is "0".
+ */
+
+/**
+ * @param {number} n
+ * @return {string}
+ */
+var baseNeg2 = function(number) {
+  if (number === 0) return '0';
+
+  let result = '';
+  let current = number;
+
+  while (current !== 0) {
+    const remainder = current & 1;
+    result = remainder + result;
+    current = (current - remainder) / -2;
+  }
+
+  return result;
+};