[LeetCode]Find Pivot

本文介绍了一种算法,该算法能够在给定整数数组的情况下找到数组的支点索引。支点索引定义为数组中一个特殊的索引位置,在该位置左侧所有元素之和等于右侧所有元素之和。若不存在这样的索引则返回-1;若有多个这样的索引,则返回最左侧的索引。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Find Pivot:

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.

class Solution {
public:
    int pivotIndex(vector<int>& nums) {
        if(nums.size()<3) return -1;
        int sum[nums.size()], max;
        for(int i = 0; i < nums.size(); i ++){
            i == 0?sum[i] = nums[i] : sum[i] = nums[i] + sum[i-1];
        }
        max  = sum[nums.size()-1];
        for(int i = 0; i < nums.size(); i++){
            if(max - sum[i] == sum[i] - nums[i]){
                return i;
            }
        }
        return -1;
    }
};

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值