Leetcode
2020.05.05 10:11

724. Find Pivot Index

조회 수 544 추천 수 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;
    }
}

[문제] https://leetcode.com/problems/find-pivot-index/



?

List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode 1055. Shortest Way to Form String hooni 2020.04.06 142
76 Leetcode 107. Binary Tree Level Order Traversal II hooni 2020.04.29 178
75 Leetcode 108. Convert Sorted Array to Binary Search Tree hooni 2020.05.01 140
74 Leetcode 110. Balanced Binary Tree hooni 2020.05.01 164
73 Leetcode 1108. Defanging an IP Address hooni 2020.05.01 146
72 Leetcode 111. Minimum Depth of Binary Tree hooni 2020.04.30 144
71 Leetcode 112. Path Sum hooni 2020.05.01 145
70 Leetcode 1122. Relative Sort Array hooni 2020.04.28 177
69 Leetcode 114. Flatten Binary Tree to Linked List hooni 2020.04.06 128
68 Leetcode 121. Best Time to Buy and Sell Stock hooni 2020.04.17 140
67 Leetcode 126. Word Ladder II hooni 2020.04.17 144
66 Leetcode 139. Word Break hooni 2020.04.18 144
65 Leetcode 2. Add Two Numbers hooni 2020.04.14 107
64 Leetcode 20. Valid Parentheses hooni 2020.04.25 232
63 Leetcode 202. Happy Number hooni 2020.04.28 166
62 Leetcode 203. Remove Linked List Elements hooni 2020.05.04 488
61 Leetcode 206. Reverse Linked List hooni 2020.04.28 125
60 Leetcode 222. Count Complete Tree Nodes hooni 2020.05.05 534
59 Leetcode 225. Implement Stack using Queues hooni 2020.05.05 554
58 Leetcode 23. Merge k Sorted Lists hooni 2020.04.14 115
Board Pagination Prev 1 2 3 4 Next
/ 4