Commit 6d3f3c5

committed

Add C++ implementation

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

1 parent e9af039 commit 6d3f3c5Copy full SHA for 6d3f3c5

File tree

+47

-4

lines changed

+47

-4

lines changed

Lines changed: 2 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,10 +8,8 @@ struct object {`
`8`	`8`
`9`	`9`	`static int compare(const void o1, const void o2)`
`10`	`10`	`{`
`11`		`- char p1[32];`
`12`		`- char p2[32];`
`13`		`- p1[0] = '0円';`
`14`		`- p2[0] = '0円';`
	`11`	`+ char p1[32] = { '0円' };`
	`12`	`+ char p2[32] = { '0円' };`
`15`	`13`	`strcat(p1, ((struct object *) o1)->buf);`
`16`	`14`	`strcat(p1, ((struct object *) o2)->buf);`
`17`	`15`	`strcat(p2, ((struct object *) o2)->buf);`

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+#include <bits/stdc++.h>`
	`2`	`+`
	`3`	`+using namespace std;`
	`4`	`+`
	`5`	`+class Solution {`
	`6`	`+public:`
	`7`	`+ string largestNumber(vector<int>& nums) {`
	`8`	`+ vector<string> strs;`
	`9`	`+ for (const auto i : nums) {`
	`10`	`+ strs.push_back(to_string(i));`
	`11`	`+ }`
	`12`	`+`
	`13`	`+ auto cmp = [](string s1, string s2) { return s1 + s2 > s2 + s1; };`
	`14`	`+ sort(strs.begin(), strs.end(), cmp);`
	`15`	`+`
	`16`	`+ if (strs[0] == "0") {`
	`17`	`+ return "0";`
	`18`	`+ }`
	`19`	`+`
	`20`	`+ string res;`
	`21`	`+ for (const auto& s : strs) {`
	`22`	`+ res += s;`
	`23`	`+ }`
	`24`	`+ return res;`
	`25`	`+ }`
	`26`	`+};`

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,19 @@`
	`1`	`+#include <bits/stdc++.h>`
	`2`	`+`
	`3`	`+using namespace std;`
	`4`	`+`
	`5`	`+class Solution {`
	`6`	`+public:`
	`7`	`+ int findKthLargest(vector<int>& nums, int k) {`
	`8`	`+ priority_queue<int, vector<int>, greater<int>> queue;`
	`9`	`+ for (const auto i : nums) {`
	`10`	`+ if (queue.size() < k) {`
	`11`	`+ queue.push(i);`
	`12`	`+ } else if (i > queue.top()) {`
	`13`	`+ queue.pop();`
	`14`	`+ queue.push(i);`
	`15`	`+ }`
	`16`	`+ }`
	`17`	`+ return queue.top();`
	`18`	`+ }`
	`19`	`+};`

Comments

(0)