zoukankan      html  css  js  c++  java
  • 724. Find Pivot Index

    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.
    

    Examlple 2:

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

    给定一个数组,找出一个数,左边元素之和等于右边元素之和,存在范围其index,反之-1
    假定存在这个数,满足:

    • 1.left + nums[i] + right = sum
    • 2.left = right
    • 3.sum - 2 * left = nums[i]
        public int pivotIndex(int[] nums) {
            int sum = 0;
            for(int num:nums)
                sum += num;
            int left=0;
            for(int i = 0; i < nums.length; i++)
            {  if (i != 0)
                    left += nums[i-1]; //确保是在‘pivot’的左侧
                if(sum - 2 * left == nums[i]) return i;
            }
            return -1;
        }
    
  • 相关阅读:
    Flask_自定义参数类型(自定义转换器)
    数据结构与算法(排序)
    数据结构与算法(查找)
    Vue_fetch和axios数据请求
    Vue_修饰符
    Vue_列表过滤应用
    Vue_生命周期函数
    Vue_watch()方法,检测数据的改变
    Django_redis_缓存
    防火墙相关
  • 原文地址:https://www.cnblogs.com/wxshi/p/7871610.html
Copyright © 2011-2022 走看看