Add solution #179

Author: JoshCrozier

README.md

@@ -55,6 +55,7 @@
 145|[Binary Tree Postorder Traversal](./0145-binary-tree-postorder-traversal.js)|Easy|
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
 152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|
+179|[Largest Number](./0179-largest-number.js)|Medium|
 203|[Remove Linked List Elements](./0203-remove-linked-list-elements.js)|Easy|
 206|[Reverse Linked List](./0206-reverse-linked-list.js)|Easy|
 217|[Contains Duplicate](./0217-contains-duplicate.js)|Easy|

solutions/0179-largest-number.js

@@ -0,0 +1,22 @@
+/**
+ * 179. Largest Number
+ * https://leetcode.com/problems/largest-number/
+ * Difficulty: Medium
+ *
+ * Given a list of non-negative integers nums, arrange them such that they
+ * form the largest number.
+ *
+ * Note: The result may be very large, so you need to return a string
+ * instead of an integer.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {string}
+ */
+var largestNumber = function(nums) {
+  return nums
+    .sort((a, b) => `${b}${a}` - `${a}${b}`)
+    .join('')
+    .replace(/^0+/, 0);
+};