We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent ecf35d8 commit 30d868fCopy full SHA for 30d868f
scripts/algorithms/F/Find Pivot Index/Find Pivot Index.java
@@ -1,19 +1,20 @@
1
+// Runtime: 1 ms (Top 100.00%) | Memory: 43.2 MB (Top 91.78%)
2
class Solution {
3
public int pivotIndex(int[] nums) {
-
4
- int leftsum = 0;
+
5
+ int leftsum = 0;
6
int rightsum = 0;
7
8
for(int i =1; i< nums.length; i++) rightsum += nums[i];
9
10
if (leftsum == rightsum) return 0;
11
12
for(int i = 1 ; i < nums.length; i++){
13
leftsum += nums[i-1];
14
rightsum -= nums[i];
15
16
if(leftsum == rightsum) return i;
17
}
18
return -1;
19
-}
20
+}
0 commit comments