Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
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.