add 179

Author: luliyucoordinate

README.md

@@ -168,6 +168,7 @@ LeetCode
 |0172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) | c | [c++](./src/0172-Factorial-Trailing-Zeroes/0172.cpp) |[python](./src/0172-Factorial-Trailing-Zeroes/0172.py)|||Easy|
 |0173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | c | [c++](./src/0173-Binary-Search-Tree-Iterator/0173.cpp) |[python](./src/0173-Binary-Search-Tree-Iterator/0173.py)|||Medium|
 |0174|[Dungeon Game](https://leetcode.com/problems/dungeon-game/) | c | [c++](./src/0174-Dungeon-Game/0174.cpp) |[python](./src/0174-Dungeon-Game/0174.py)|||Hard|
+|0179|[Largest Number](https://leetcode.com/problems/largest-number/) | c | [c++](./src/0179-Largest-Number/0179.cpp) |[python](./src/0179-Largest-Number/0179.py)|||Medium|
 |0187|[Repeated-DNA-Sequences](https://leetcode.com/problems/repeated-dna-sequences/) | c | [c++](./src/0187-Repeated-DNA-Sequences/0187.cpp) |[python](./src/0187-Repeated-DNA-Sequences/0187.py)|||Medium|
 |0188|[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | c | [c++](./src/0188-Best-Time-to-Buy-and-Sell-Stock-IV/0188.cpp) |[python](./src/0188-Best-Time-to-Buy-and-Sell-Stock-IV/0188.py)|||Hard|
 |0189|[Rotate Array](https://leetcode.com/problems/rotate-array/) | c | [c++](./src/0189-Rotate-Array/0189.cpp) |[python](./src/0189-Rotate-Array/0189.py)|||Easy|

src/0179-Largest-Number/0179.cpp

@@ -0,0 +1,20 @@
+static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
+class Solution 
+{
+public:
+    string largestNumber(vector<int>& nums) 
+    {
+        sort(nums.begin(), nums.end(), [](const int a, const int b) {
+            string as = to_string(a), bs = to_string(b);
+            return as + bs > bs + as;
+        });
+        
+        if (nums[0] == 0) return "0";
+        string res;
+        for (int j = 0; j < nums.size(); ++j) 
+        {
+            res += to_string(nums[j]);
+        }
+        return res;
+    }
+};

src/0179-Largest-Number/0179.py

@@ -0,0 +1,10 @@
+class compare(str):
+    def __lt__(x, y):
+        return x+y > y+x
+
+class Solution:
+    def largestNumber(self, nums: List[int]) -> str:
+        if not nums:
+            return ""
+        nums = sorted(list(map(str, nums)), key=compare)
+        return '0' if nums[0] == '0' else "".join(nums)