Leetcode
2020.05.05 10:11

# 724. Find Pivot Index

조회 수 751 추천 수 0 댓글 0
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

Given an array of integers `nums`, write a method that returns the "pivot" index of this array.

We define the pivot index as the index where the sum of the numbers to the left of the index is equal to the sum of the numbers to the right of the index.

If no such index exists, we should return -1. If there are multiple pivot indexes, you should return the left-most pivot index.

Example 1:

```Input:
nums = [1, 7, 3, 6, 5, 6]
Output: 3
Explanation:
The sum of the numbers to the left of index 3 (nums[3] = 6) is equal to the sum of numbers to the right of index 3.
Also, 3 is the first index where this occurs.
```

Example 2:

```Input:
nums = [1, 2, 3]
Output: -1
Explanation:
There is no index that satisfies the conditions in the problem statement.
```

Note:

• The length of `nums` will be in the range `[0, 10000]`.
• Each element `nums[i]` will be an integer in the range `[-1000, 1000]`.

```class Solution {
public int pivotIndex(int[] nums) {
int pivot = -1;

for(int i=0; i<nums.length; i++){
int sum1 = 0;
int sum2 = 0;

for(int m=0; m<i; m++){
sum1 += nums[m];
}
for(int n=i+1; n<nums.length; n++){
sum2 += nums[n];
}

if(sum1 == sum2){
pivot = i;
break;
}
}

return pivot;
}
}```

```class Solution {
public int pivotIndex(int[] nums) {
int pivot = -1;

int sum = 0;
int comp = 0;

for(int num : nums){
sum += num;
}

for(int i=0; i<nums.length; i++){
if(comp == sum - comp - nums[i]){
return i;
}
comp += nums[i];
}

return pivot;
}
}```

?

 제목+내용제목내용댓글이름닉네임아이디태그
1. ### 720. Longest Word in Dictionary

Date2020.05.07 CategoryLeetcode Byhooni Views928
2. ### 225. Implement Stack using Queues

Date2020.05.05 CategoryLeetcode Byhooni Views781
3. ### 56. Merge Intervals

Date2020.05.05 CategoryLeetcode Byhooni Views729
4. ### 844. Backspace String Compare

Date2020.05.05 CategoryLeetcode Byhooni Views824
5. ### 222. Count Complete Tree Nodes

Date2020.05.05 CategoryLeetcode Byhooni Views756
6. ### 697. Degree of an Array

Date2020.05.05 CategoryLeetcode Byhooni Views818
7. ### 605. Can Place Flowers

Date2020.05.05 CategoryLeetcode Byhooni Views736
8. ### 724. Find Pivot Index

Date2020.05.05 CategoryLeetcode Byhooni Views751
9. ### 448. Find All Numbers Disappeared in an Array

Date2020.05.05 CategoryLeetcode Byhooni Views726
10. ### 628. Maximum Product of Three Numbers

Date2020.05.05 CategoryLeetcode Byhooni Views705
11. ### 532. K-diff Pairs in an Array

Date2020.05.04 CategoryLeetcode Byhooni Views764
12. ### 897. Increasing Order Search Tree

Date2020.05.04 CategoryLeetcode Byhooni Views725
13. ### 872. Leaf-Similar Trees

Date2020.05.04 CategoryLeetcode Byhooni Views719
14. ### 876. Middle of the Linked List

Date2020.05.04 CategoryLeetcode Byhooni Views710
15. ### 203. Remove Linked List Elements

Date2020.05.04 CategoryLeetcode Byhooni Views697
16. ### 997. Find the Town Judge

Date2020.05.02 CategoryLeetcode Byhooni Views761
17. ### 270. Closest Binary Search Tree Value

Date2020.05.01 CategoryLeetcode Byhooni Views694
18. ### 687. Longest Univalue Path

Date2020.05.01 CategoryLeetcode Byhooni Views756