leetcode 724. Find Pivot Index
LeetCode Find index pivot
2023-09-14 09:11:52 时间
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(object): def pivotIndex(self, nums): """ :type nums: List[int] :rtype: int """ n = len(nums) s1, s2 = [0]*n, [0]*n sum1, sum2 = 0, 0 for i in xrange(0, n): sum1 += nums[i] sum2 += nums[n-1-i] s1[i] = sum1 s2[n-1-i] = sum2 for i in xrange(0, n): if s1[i] == s2[i]: return i return -1
如果不用O(n)空间,则:
class Solution(object): def pivotIndex(self, nums): """ :type nums: List[int] :rtype: int """ s1 = sum(nums) s2 = 0 for i in xrange(0, len(nums)): s2 += nums[i] if s1 - s2 == s2 - nums[i]: return i return -1
相关文章
- ☆打卡算法☆LeetCode 212. 单词搜索 II 算法解析
- LeetCode周赛292,800多人做出第四题,大佬怒喷太简单……
- leetcode-38外观数列
- LeetCode 387. 字符串中的第一个唯一字符
- leetcode 35. 搜索插入位置 js 实现
- LeetCode周赛325,反向思考专场,你有逆向思维吗?
- 用Js刷LeetCode拿offer-经典高频40题
- golang刷leetcode:数据流中的中位数
- leetcode 二分查找 35. Search Insert Position
- leetcode每日一题:数组的相对排序
- LeetCode——根据二叉树创建字符串与二叉树的最近公共祖先
- LeetCode 0050 Pow(x,n)详解编程语言
- Leetcode(153) Find Minimum in Rotated Sorted Array详解编程语言
- 使用Linux Find命令快速搜索文件(linux中find命令)
- 探索Linux世界的Find命令(linux的命令find)
- 命令的基本使用Linux下Find命令的基本用法简介(linux中find)
- MySQL中的Find函数快速定位数据行(mysql中find函数)