Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
AhkunTa
Arithmetic
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Arithmetic
/
LeetCode
/
724_javascript.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
72 lines (60 loc) · 1.83 KB
master
Breadcrumbs
Arithmetic
/
LeetCode
/
724_javascript.js
Copy path
Top
File metadata and controls
Code
Blame
72 lines (60 loc) · 1.83 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
// 给定一个整数类型的数组 nums,请编写一个能够返回数组 “中心索引” 的方法。
// 我们是这样定义数组 中心索引 的:数组中心索引的左侧所有元素相加的和等于右侧所有元素相加的和。
// 如果数组不存在中心索引,那么我们应该返回 -1。如果数组有多个中心索引,那么我们应该返回最靠近左边的那一个。
//
// 示例 1:
// 输入:
// nums = [1, 7, 3, 6, 5, 6]
// 输出:3
// 解释:
// 索引 3 (nums[3] = 6) 的左侧数之和 (1 + 7 + 3 = 11),与右侧数之和 (5 + 6 = 11) 相等。
// 同时, 3 也是第一个符合要求的中心索引。
// 示例 2:
// 输入:
// nums = [1, 2, 3]
// 输出:-1
// 解释:
// 数组中不存在满足此条件的中心索引。
//
// 说明:
// nums 的长度范围为 [0, 10000]。
// 任何一个 nums[i] 将会是一个范围在 [-1000, 1000]的整数。
/**
* @param {number[]} nums
* @return {number}
*/
// 取左右值比较
var pivotIndex = function (nums) {
if (nums.length < 3) return -1;
let left = 0;
let right = nums.reduce((arr, cur) => {
return arr + cur;
});
right -= nums[0];
// 此处判断 当中心索引为0 的时候
// 无判断会导致测试用例 [-1,-1,-1,0,1,1] 不通过
if (left == right) return 0;
for (let i = 0; i < nums.length - 1; i++) {
left += nums[i];
right -= nums[i + 1];
if (right == left) {
return i + 1;
}
}
return -1;
};
// 另一种方法 左边值 * 2 + 中心索引值 == 数组总和
var pivotIndex = function (nums) {
if (nums.length < 3) return -1;
let left = 0;
let sum = nums.reduce((arr, cur) => {
return arr + cur;
});
for (let i = 0; i < nums.length; i++) {
left += nums[i - 1] || 0;
if (left * 2 + nums[i] == sum) {
return i;
}
}
return -1;
};
You can’t perform that action at this time.