Runtime: 370 ms (Top 57.12%) | Memory: 107.8 MB (Top 57.19%)

AnasImloul · AnasImloul · commit a8ae083a5f0a · 2022-09-26T17:56:05.000+01:00
diff --git a/scripts/algorithms/M/Minimum Swaps To Make Sequences Increasing/Minimum Swaps To Make Sequences Increasing.cpp b/scripts/algorithms/M/Minimum Swaps To Make Sequences Increasing/Minimum Swaps To Make Sequences Increasing.cpp
@@ -1,3 +1,4 @@
+// Runtime: 370 ms (Top 57.12%) | Memory: 107.8 MB (Top 57.19%)
 class Solution {
 public:
     int n;
@@ -30,7 +31,7 @@ class Solution {
         }
         return dp[index][sp]=ans;
     }
-    int minSwap(vector<int>& nums1, vector<int>& nums2) 
+    int minSwap(vector<int>& nums1, vector<int>& nums2)
     {
         memset(dp,-1,sizeof(dp));
         nums1.insert(nums1.begin(),-1);
@@ -40,4 +41,4 @@ class Solution {
         this->nums2=nums2;
         return find(1,0);
     }
-};
+};

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+// Runtime: 370 ms (Top 57.12%) \| Memory: 107.8 MB (Top 57.19%)`
`1`	`2`	`class Solution {`
`2`	`3`	`public:`
`3`	`4`	`int n;`
`@@ -30,7 +31,7 @@ class Solution {`
`30`	`31`	`}`
`31`	`32`	`return dp[index][sp]=ans;`
`32`	`33`	`}`
`33`		`- int minSwap(vector<int>& nums1, vector<int>& nums2)`
	`34`	`+ int minSwap(vector<int>& nums1, vector<int>& nums2)`
`34`	`35`	`{`
`35`	`36`	`memset(dp,-1,sizeof(dp));`
`36`	`37`	`nums1.insert(nums1.begin(),-1);`
`@@ -40,4 +41,4 @@ class Solution {`
`40`	`41`	`this->nums2=nums2;`
`41`	`42`	`return find(1,0);`
`42`	`43`	`}`
`43`		`-};`
	`44`	`+};`