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;
}
}

?

 제목+내용제목내용댓글이름닉네임아이디태그
List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
74 Leetcode 720. Longest Word in Dictionary 2020.05.07 928
73 Leetcode 225. Implement Stack using Queues 2020.05.05 781
72 Leetcode 56. Merge Intervals 2020.05.05 729
71 Leetcode 844. Backspace String Compare 2020.05.05 824
70 Leetcode 222. Count Complete Tree Nodes 2020.05.05 756
69 Leetcode 697. Degree of an Array 2020.05.05 818
68 Leetcode 605. Can Place Flowers 2020.05.05 736
» Leetcode 724. Find Pivot Index 2020.05.05 751
66 Leetcode 448. Find All Numbers Disappeared in an Array 2020.05.05 726
65 Leetcode 628. Maximum Product of Three Numbers 2020.05.05 705
64 Leetcode 532. K-diff Pairs in an Array 2020.05.04 765
63 Leetcode 897. Increasing Order Search Tree 2020.05.04 725
62 Leetcode 872. Leaf-Similar Trees 2020.05.04 719
61 Leetcode 876. Middle of the Linked List 2020.05.04 711
60 Leetcode 203. Remove Linked List Elements 2020.05.04 697
59 Leetcode 997. Find the Town Judge 2020.05.02 761
58 Leetcode 270. Closest Binary Search Tree Value 2020.05.01 694
57 Leetcode 687. Longest Univalue Path 2020.05.01 756
56 Leetcode 783. Minimum Distance Between BST Nodes 2020.05.01 768
55 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree 2020.05.01 756
Board Pagination Prev 1 2 3 4 Next
/ 4