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
/
1282_javascript.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
67 lines (51 loc) · 2.05 KB
master
Breadcrumbs
Arithmetic
/
LeetCode
/
1282_javascript.js
Copy path
Top
File metadata and controls
Code
Blame
67 lines (51 loc) · 2.05 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
// 有 n 位用户参加活动,他们的 ID 从 0 到 n - 1,每位用户都 恰好 属于某一用户组。给你一个长度为 n 的数组 groupSizes,其中包含每位用户所处的用户组的大小,请你返回用户分组情况(存在的用户组以及每个组中用户的 ID)。
// 你可以任何顺序返回解决方案,ID 的顺序也不受限制。此外,题目给出的数据保证至少存在一种解决方案。
//
// 示例 1:
// 输入:groupSizes = [3,3,3,3,3,1,3]
// 输出:[[5],[0,1,2],[3,4,6]]
// 解释:
// 其他可能的解决方案有 [[2,1,6],[5],[0,4,3]] 和 [[5],[0,6,2],[4,3,1]]。
// 示例 2:
// 输入:groupSizes = [2,1,3,3,3,2]
// 输出:[[1],[0,5],[2,3,4]]
//
// 提示:
// groupSizes.length == n
// 1 <= n <= 500
// 1 <= groupSizes[i] <= n
// 输入:groupSizes = [2,1,3,3,3,2]
// 输出:[[1],[0,5],[2,3,4]]
// 数组的索引对应的是用户的 ID,用上面的代码来举例。例如用户 0 所在组大小为 2,
// 也就是说这个组有 2 个人。然后索引 5,也就是用户 5 所在的用户组也是 2。说明用户 0 和用户 5 是在一个组。
// 索引 1,也就是用户 1 所在的组为 1,只有它自己。用户 2 3 4 为一组,因为组大小为 3,有 3 个人。
// 这样就能看出来有 3 个组了,所以答案是 [[1],[0,5],[2,3,4]]。
/**
* @param {number[]} groupSizes
* @return {number[][]}
*/
// [2,1,3,3,3,2]
var groupThePeople = function(groupSizes) {
let res = [];
let hash = {};
for(let i=0; i<groupSizes.length; i++){
// 转换hash
// {
// 2:[0,5],
// 1: [2],
// 3: [2,3,4]
// }
if(!hash[groupSizes[i]]){
hash[groupSizes[i]] = [];
}
hash[groupSizes[i]].push(i)
// 判断数组长度等于 key值
if(hash[groupSizes[i]].length == groupSizes[i]){
// res数组内push 当前数组
res.push(hash[groupSizes[i]]);
// 再将当前数组置空
hash[groupSizes[i]] = []
}
}
return res
};
You can’t perform that action at this time.