Runtime: 175 ms (Top 32.17%) | Memory: 41.7 MB (Top 33.74%)

AnasImloul · AnasImloul · commit 534cfb4685cc · 2022-09-08T23:25:23.000+01:00
diff --git a/scripts/algorithms/L/Longest Harmonious Subsequence/Longest Harmonious Subsequence.cpp b/scripts/algorithms/L/Longest Harmonious Subsequence/Longest Harmonious Subsequence.cpp
@@ -1,6 +1,7 @@
+// Runtime: 175 ms (Top 32.17%) | Memory: 41.7 MB (Top 33.74%)
 class Solution {
 public:
-    int findLHS(vector<int>& nums) 
+    int findLHS(vector<int>& nums)
     {
         map<int,int> m;
         for(int i=0;i<nums.size();i++)
@@ -19,7 +20,7 @@ class Solution {
             y=i->second;
         }
         return ans;
-        
+
     }
 };
 //if you like the solution plz upvote.

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,7 @@`
	`1`	`+// Runtime: 175 ms (Top 32.17%) \| Memory: 41.7 MB (Top 33.74%)`
`1`	`2`	`class Solution {`
`2`	`3`	`public:`
`3`		`- int findLHS(vector<int>& nums)`
	`4`	`+ int findLHS(vector<int>& nums)`
`4`	`5`	`{`
`5`	`6`	`map<int,int> m;`
`6`	`7`	`for(int i=0;i<nums.size();i++)`
`@@ -19,7 +20,7 @@ class Solution {`
`19`	`20`	`y=i->second;`
`20`	`21`	`}`
`21`	`22`	`return ans;`
`22`		`-`
	`23`	`+`
`23`	`24`	`}`
`24`	`25`	`};`
`25`	`26`	`//if you like the solution plz upvote.`