update: 179

Author: hijiangtao

README.md

@@ -100,6 +100,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 | 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables/)                                                                         | [SQL](./src/combine-two-tables/res.txt)                                                                           | Easy       |
 | 176 | [Second Highest Salary](https://leetcode.com/problems/second-highest-salary/)                                                                   | [SQL](./src/second-highest-salary/res.txt)                                                                        | Easy       |
 | 177 | [Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary/)                                                                         | [SQL](./src/nth-highest-salary/res.txt)                                                                           | Medium     |
+| 179 | [largest-number](https://leetcode.com/problems/largest-number/)                                                                                 | [TypeScript](./src/largest-number/res.ts)                                                                         | Medium     |
 | 181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/)                         | [SQL](./src/employees-earning-more-than-their-managers/res.txt)                                                   | Easy       |
 | 182 | [Duplicate Emails](https://leetcode.com/problems/duplicate-emails/)                                                                             | [SQL](./src/duplicate-emails/res.txt)                                                                             | Easy       |
 | 183 | [Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order/)                                                           | [SQL](./src/customers-who-never-order/res.txt)                                                                    | Easy       |

src/largest-number/res.ts

@@ -0,0 +1,10 @@
+function largestNumber(nums: number[]): string {
+    const stringNums = nums.map(n=>n.toString());
+
+    stringNums.sort((a,b) => b+a > a+b ? 1: -1);
+    const result = stringNums.join('');
+
+    if (result.indexOf('0') === 0) return '0';
+
+    return result;
+};