Add solution #386

Author: JoshCrozier

README.md

@@ -304,6 +304,7 @@
 383|[Ransom Note](./0383-ransom-note.js)|Easy|
 384|[Shuffle an Array](./0384-shuffle-an-array.js)|Medium|
 385|[Mini Parser](./0385-mini-parser.js)|Medium|
+386|[Lexicographical Numbers](./0386-lexicographical-numbers.js)|Medium|
 387|[First Unique Character in a String](./0387-first-unique-character-in-a-string.js)|Easy|
 389|[Find the Difference](./0389-find-the-difference.js)|Easy|
 392|[Is Subsequence](./0392-is-subsequence.js)|Easy|

solutions/0386-lexicographical-numbers.js

@@ -0,0 +1,32 @@
+/**
+ * 386. Lexicographical Numbers
+ * https://leetcode.com/problems/lexicographical-numbers/
+ * Difficulty: Medium
+ *
+ * Given an integer n, return all the numbers in the range [1, n] sorted in lexicographical order.
+ *
+ * You must write an algorithm that runs in O(n) time.
+ */
+
+/**
+ * @param {number} n
+ * @return {number[]}
+ */
+var lexicalOrder = function(n) {
+  const result = [];
+  let value = 1;
+
+  for (let i = 0; i < n; i++) {
+    result.push(value);
+    if (value * 10 <= n) {
+      value *= 10;
+    } else {
+      while (value % 10 === 9 || value >= n) {
+        value = Math.floor(value / 10);
+      }
+      value++;
+    }
+  }
+
+  return result;
+};