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
/
135_javascript.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
47 lines (37 loc) · 1.48 KB
master
Breadcrumbs
Arithmetic
/
LeetCode
/
135_javascript.js
Copy path
Top
File metadata and controls
Code
Blame
47 lines (37 loc) · 1.48 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
// 老师想给孩子们分发糖果,有 N 个孩子站成了一条直线,老师会根据每个孩子的表现,预先给他们评分。
// 你需要按照以下要求,帮助老师给这些孩子分发糖果:
// 每个孩子至少分配到 1 个糖果。
// 评分更高的孩子必须比他两侧的邻位孩子获得更多的糖果。
// 那么这样下来,老师至少需要准备多少颗糖果呢?
//
// 示例 1:
// 输入:[1,0,2]
// 输出:5
// 解释:你可以分别给这三个孩子分发 2、1、2 颗糖果。
// 示例 2:
// 输入:[1,2,2]
// 输出:4
// 解释:你可以分别给这三个孩子分发 1、2、1 颗糖果。
// 第三个孩子只得到 1 颗糖果,这已满足上述两个条件。
/**
* @param {number[]} ratings
* @return {number}
*/
var candy = function (ratings) {
// 先所有孩子赋值1个糖果
let arr = new Array(ratings.length).fill(1);
// 循环判断后一个孩子是否比前一个孩子分高 若分高 则糖果数为前一个孩子的分数加一
for (let i = 1; i < ratings.length; i++) {
if (ratings[i] > ratings[i - 1]) {
arr[i] = arr[i - 1] + 1;
}
}
// 反向循环判断前一个孩子是否比后一个孩子分高 若分高 则糖果数为后一个孩子的分数加一
for (let j = ratings.length - 2; j >= 0; j--) {
if (ratings[j] > ratings[j + 1]) {
arr[j] = Math.max(arr[j], arr[j + 1] + 1);
}
}
let res = arr.reduce((acc, cur) => acc + cur);
return res;
};
You can’t perform that action at this time.