Skip to content

Commit 30d868f

Browse files
committed
Runtime: 1 ms (Top 100.00%) | Memory: 43.2 MB (Top 91.78%)
1 parent ecf35d8 commit 30d868f

File tree

1 file changed

+8
-7
lines changed

1 file changed

+8
-7
lines changed
Lines changed: 8 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,19 +1,20 @@
1+
// Runtime: 1 ms (Top 100.00%) | Memory: 43.2 MB (Top 91.78%)
12
class Solution {
23
public int pivotIndex(int[] nums) {
3-
4-
int leftsum = 0;
4+
5+
int leftsum = 0;
56
int rightsum = 0;
6-
7+
78
for(int i =1; i< nums.length; i++) rightsum += nums[i];
8-
9+
910
if (leftsum == rightsum) return 0;
10-
11+
1112
for(int i = 1 ; i < nums.length; i++){
1213
leftsum += nums[i-1];
1314
rightsum -= nums[i];
14-
15+
1516
if(leftsum == rightsum) return i;
1617
}
1718
return -1;
1819
}
19-
}
20+
}

0 commit comments

Comments
 (0)