feat: add solutions to lc problem: No.0179

Author: rain84

solution/0100-0199/0179.Largest Number/README.md

@@ -183,6 +183,32 @@ public class Solution {
 }
 ```
 
+#### TypeScript
+
+```ts
+function largestNumber(nums: number[]): string {
+    nums.sort((a, b) => {
+        const [ab, ba] = [String(a) + String(b), String(b) + String(a)];
+        return +ba - +ab;
+    });
+
+    return nums[0] ? nums.join('') : '0';
+}
+```
+
+#### JavaScript
+
+```js
+function largestNumber(nums) {
+    nums.sort((a, b) => {
+        const [ab, ba] = [String(a) + String(b), String(b) + String(a)];
+        return +ba - +ab;
+    });
+
+    return nums[0] ? nums.join('') : '0';
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0100-0199/0179.Largest Number/README_EN.md

@@ -180,6 +180,32 @@ public class Solution {
 }
 ```
 
+#### TypeScript
+
+```ts
+function largestNumber(nums: number[]): string {
+    nums.sort((a, b) => {
+        const [ab, ba] = [String(a) + String(b), String(b) + String(a)];
+        return +ba - +ab;
+    });
+
+    return nums[0] ? nums.join('') : '0';
+}
+```
+
+#### JavaScript
+
+```js
+function largestNumber(nums) {
+    nums.sort((a, b) => {
+        const [ab, ba] = [String(a) + String(b), String(b) + String(a)];
+        return +ba - +ab;
+    });
+
+    return nums[0] ? nums.join('') : '0';
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0100-0199/0179.Largest Number/Solution.js

@@ -0,0 +1,8 @@
+function largestNumber(nums) {
+    nums.sort((a, b) => {
+        const [ab, ba] = [String(a) + String(b), String(b) + String(a)];
+        return +ba - +ab;
+    });
+
+    return nums[0] ? nums.join('') : '0';
+}

solution/0100-0199/0179.Largest Number/Solution.ts

@@ -0,0 +1,8 @@
+function largestNumber(nums: number[]): string {
+    nums.sort((a, b) => {
+        const [ab, ba] = [String(a) + String(b), String(b) + String(a)];
+        return +ba - +ab;
+    });
+
+    return nums[0] ? nums.join('') : '0';
+}