LeetCode724. Find Pivot Index
来源:互联网 发布:国密算法sm代码java 编辑:程序博客网 时间:2024/06/07 06:22
原题:https://leetcode.com/problems/find-pivot-index/description/
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].
求一个pivot是的pivot左右两边之和相等,实质就是求某一边和等于除去pivot的所有数的和的一半。
首先遍历一遍数组求得所有数之和,然后再从左遍历一次,每次把当前左边所有数的和与先前求得的所有数的和减去当前pivot所指的数再减半后的值对比(if (leftsum == (sum-nums[i])/2)),如果相等则表明当前左右两边相等,如果没有找到这个数,则返回-1.
class Solution {public: int pivotIndex(vector<int>& nums) { double sum = 0; for (int i = 0; i < nums.size(); i++) { sum += nums[i]; } double leftsum = 0; for (int i = 0; i < nums.size(); i++) { if (leftsum == (sum-nums[i])/2) { return i; } else { leftsum += nums[i]; } } return -1; }};
741 / 741 test cases passed.
Status: Accepted
Runtime: 42 ms
- LeetCode724. Find Pivot Index
- 724. Find Pivot Index
- 724. Find Pivot Index
- LeetCode.724 Find Pivot Index
- leetcode 724 Find Pivot Index
- LeetCode 724. Find Pivot Index
- LEETCODE: 724. Find Pivot Index
- Find Pivot Index[Leetcode 724]
- LeetCode-724. Find Pivot Index
- Find Pivot Index(LeetCode 724)
- Find Pivot Index问题及解法
- LWC 58:724. Find Pivot Index
- [LeetCode]Find Pivot
- PIVOT
- pivot
- PIVOT
- pivot
- PIQ12: Find pivot in a sorted rotated array
- 在stylus格式的图标字体里url无法解析
- Android事件分发机制(Demo测试)
- 【笔记-C++】 运算符重载
- 修改Android签名证书keystore的密码、别名alias以及别名密码
- 使按钮失效的disabled
- LeetCode724. Find Pivot Index
- iOS Notification 与多线程
- 坚持#第244天~2013马哥视频
- MQTT--JavaScript连接学习笔记--消息数据解析
- 文件流
- RSA 算法细节|安全性考虑|Java应用
- react-native react-navigation集成redux以及验证的flow
- 用函数编程计算并输出杨辉三角形
- ARX给CAD发送命令的五种方法