Commit 141c701

committed

solved leetcode daily challenge

See: Why: How: Tags:

1 parent 7c7e266 commit 141c701Copy full SHA for 141c701

File tree

+56

-0

lines changed

+56

-0

lines changed

Lines changed: 56 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,56 @@`
	`1`	`+#include <bits/stdc++.h>`
	`2`	`+#include <gtest/gtest.h>`
	`3`	`+using namespace std;`
	`4`	`+`
	`5`	`+`
	`6`	`+//// START`
	`7`	`+/*`
	`8`	`+## Slowest Key`
	`9`	`+`
	`10`	`+*/`
	`11`	`+`
	`12`	`+`
	`13`	`+class Solution {`
	`14`	`+ public:`
	`15`	`+ char slowestKey(vector<int>& releaseTimes, string keysPressed) {`
	`16`	`+ auto p = make_pair(keysPressed[0],releaseTimes[0]);`
	`17`	`+ for (int i = 1;i < releaseTimes.size();i++){`
	`18`	`+ if (releaseTimes[i] - releaseTimes[i-1] > p.second \|\| releaseTimes[i] - releaseTimes[i-1] == p.second && keysPressed[i] > p.first ){`
	`19`	`+ p.first = keysPressed[i];`
	`20`	`+ p.second = releaseTimes[i] - releaseTimes[i-1];`
	`21`	`+ }`
	`22`	`+ }`
	`23`	`+ return p.first;`
	`24`	`+ }`
	`25`	`+};`
	`26`	`+`
	`27`	`+//// END`
	`28`	`+struct T{`
	`29`	`+`
	`30`	`+};`
	`31`	`+`
	`32`	`+TEST(Solution,test){`
	`33`	`+ T ts[] = {`
	`34`	`+ {`
	`35`	`+`
	`36`	`+ },`
	`37`	`+ {`
	`38`	`+`
	`39`	`+ },`
	`40`	`+`
	`41`	`+ };`
	`42`	`+`
	`43`	`+`
	`44`	`+ for (T t : ts){`
	`45`	`+ Solution solution;`
	`46`	`+`
	`47`	`+ }`
	`48`	`+}`
	`49`	`+`
	`50`	`+int main() {`
	`51`	`+ testing::InitGoogleTest();`
	`52`	`+`
	`53`	`+ return RUN_ALL_TESTS();`
	`54`	`+}`
	`55`	`+`
	`56`	`+`

Comments

(0)