Leetcode
2020.05.05 10:11

724. Find Pivot Index

조회 수 560 추천 수 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 720. Longest Word in Dictionary hooni 2020.05.07 668
76 Leetcode 225. Implement Stack using Queues hooni 2020.05.05 569
75 Leetcode 56. Merge Intervals hooni 2020.05.05 529
74 Leetcode 844. Backspace String Compare hooni 2020.05.05 538
73 Leetcode 222. Count Complete Tree Nodes hooni 2020.05.05 552
72 Leetcode 697. Degree of an Array hooni 2020.05.05 628
71 Leetcode 605. Can Place Flowers hooni 2020.05.05 541
» Leetcode 724. Find Pivot Index hooni 2020.05.05 560
69 Leetcode 448. Find All Numbers Disappeared in an Array hooni 2020.05.05 510
68 Leetcode 628. Maximum Product of Three Numbers hooni 2020.05.05 517
67 Leetcode 532. K-diff Pairs in an Array hooni 2020.05.04 570
66 Leetcode 897. Increasing Order Search Tree hooni 2020.05.04 538
65 Leetcode 872. Leaf-Similar Trees file hooni 2020.05.04 527
64 Leetcode 876. Middle of the Linked List hooni 2020.05.04 515
63 Leetcode 203. Remove Linked List Elements hooni 2020.05.04 501
62 Leetcode 997. Find the Town Judge hooni 2020.05.02 562
61 Leetcode 270. Closest Binary Search Tree Value hooni 2020.05.01 493
60 Leetcode 687. Longest Univalue Path hooni 2020.05.01 570
59 Leetcode 783. Minimum Distance Between BST Nodes hooni 2020.05.01 584
58 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree file hooni 2020.05.01 570
Board Pagination Prev 1 2 3 4 Next
/ 4