Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 099eaae

Browse files
commit lc#724 by java
1 parent dcf4ebe commit 099eaae

File tree

2 files changed

+32
-1
lines changed

2 files changed

+32
-1
lines changed

‎README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ LeetCode
1010
|977|[Squares of a Sorted Array](https://leetcode-cn.com/problems/squares-of-a-sorted-array/) | [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/977-solution.go) | Easy
1111
|876|[Middle of the Linked List](https://leetcode-cn.com/problems/middle-of-the-linked-list/) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution876.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution876.rb) | Easy
1212
|766|[Toeplitz Matrix](https://leetcode-cn.com/problems/toeplitz-matrix/) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution766.java), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/766-solution.go) | Easy
13-
|724|[Find Pivot Index](https://leetcode-cn.com/problems/find-pivot-index/) | [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/724-solution.go) | Easy
13+
|724|[Find Pivot Index](https://leetcode-cn.com/problems/find-pivot-index/) [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution724.java), | [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/724-solution.go) | Easy
1414
|674|[Longest Continuous Increasing Subsequence](https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence/) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution674.java), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/674-solution.go) | Easy
1515
|665|[Non-decreasing Array](https://leetcode-cn.com/problems/non-decreasing-array//) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution665.java), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/665-solution.go) | Easy
1616
|643|[Maximum Average Subarray I](https://leetcode-cn.com/problems/maximum-average-subarray-i/) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution643.java), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/643-solution.go) | Easy

‎src/main/java/Solution724.java‎

Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
/**
2+
* LC#724:Find Pivot Index
3+
* Link:https://leetcode-cn.com/problems/find-pivot-index/
4+
* 思路:先求总和,再左求和*2+中心索引值 = 总和
5+
* @author Phoenix on 2021年5月9日.
6+
*/
7+
public class Solution724 {
8+
9+
public static int pivotIndex(int[] nums) {
10+
int arrayTotal = 0;
11+
for (int num : nums) {
12+
arrayTotal += num;
13+
}
14+
int sum = 0;
15+
for (int i = 0; i < nums.length; i++) {
16+
if (sum * 2 + nums[i] == arrayTotal) {
17+
return i;
18+
}
19+
sum += nums[i];
20+
}
21+
return -1;
22+
}
23+
24+
25+
public static void main(String[] args) {
26+
int[] nums = {1, 7, 3, 6, 5, 6};
27+
int res = pivotIndex(nums);
28+
System.out.println("res:" + res);
29+
}
30+
31+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /