Runtime: 2 ms (Top 16.64%) | Memory: 42.4 MB (Top 52.37%)

AnasImloul · AnasImloul · commit f168c8df437e · 2022-09-03T21:40:12.000+01:00
diff --git a/scripts/algorithms/F/Find the Middle Index in Array/Find the Middle Index in Array.java b/scripts/algorithms/F/Find the Middle Index in Array/Find the Middle Index in Array.java
@@ -1,23 +1,22 @@
+// Runtime: 2 ms (Top 16.64%) | Memory: 42.4 MB (Top 52.37%)
 
 class Solution {
     public int findMiddleIndex(int[] nums) {
-        
+
         for(int i=0;i<nums.length;i++)
         {
             int rsum=0;
             int lsum=0;
-            
+
             for(int k=0;k<i;k++) lsum+=nums[k];
             for(int k=i+1;k<nums.length;k++) rsum+=nums[k];
-            
-            
+
             if(lsum==rsum){
                 return i;
             }
         }
-        
+
         return -1;
-        
+
     }
 }
-

Original file line number	Diff line number	Diff line change
`@@ -1,23 +1,22 @@`
	`1`	`+// Runtime: 2 ms (Top 16.64%) \| Memory: 42.4 MB (Top 52.37%)`
`1`	`2`
`2`	`3`	`class Solution {`
`3`	`4`	`public int findMiddleIndex(int[] nums) {`
`4`		`-`
	`5`	`+`
`5`	`6`	`for(int i=0;i<nums.length;i++)`
`6`	`7`	`{`
`7`	`8`	`int rsum=0;`
`8`	`9`	`int lsum=0;`
`9`		`-`
	`10`	`+`
`10`	`11`	`for(int k=0;k<i;k++) lsum+=nums[k];`
`11`	`12`	`for(int k=i+1;k<nums.length;k++) rsum+=nums[k];`
`12`		`-`
`13`		`-`
	`13`	`+`
`14`	`14`	`if(lsum==rsum){`
`15`	`15`	`return i;`
`16`	`16`	`}`
`17`	`17`	`}`
`18`		`-`
	`18`	`+`
`19`	`19`	`return -1;`
`20`		`-`
	`20`	`+`
`21`	`21`	`}`
`22`	`22`	`}`
`23`		`-`