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
/
443_javascript.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
65 lines (53 loc) · 2.17 KB
master
Breadcrumbs
Arithmetic
/
LeetCode
/
443_javascript.js
Copy path
Top
File metadata and controls
Code
Blame
65 lines (53 loc) · 2.17 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
// 给你一个字符数组 chars ,请使用下述算法压缩:
// 从一个空字符串 s 开始。对于 chars 中的每组 连续重复字符 :
// 如果这一组长度为 1 ,则将字符追加到 s 中。
// 否则,需要向 s 追加字符,后跟这一组的长度。
// 压缩后得到的字符串 s 不应该直接返回 ,需要转储到字符数组 chars 中。需要注意的是,如果组长度为 10 或 10 以上,则在 chars 数组中会被拆分为多个字符。
// 请在 修改完输入数组后 ,返回该数组的新长度。
// 你必须设计并实现一个只使用常量额外空间的算法来解决此问题。
//
// 示例 1:
// 输入:chars = ["a","a","b","b","c","c","c"]
// 输出:返回 6 ,输入数组的前 6 个字符应该是:["a","2","b","2","c","3"]
// 解释:
// "aa" 被 "a2" 替代。"bb" 被 "b2" 替代。"ccc" 被 "c3" 替代。
// 示例 2:
// 输入:chars = ["a"]
// 输出:返回 1 ,输入数组的前 1 个字符应该是:["a"]
// 解释:
// 没有任何字符串被替代。
// 示例 3:
// 输入:chars = ["a","b","b","b","b","b","b","b","b","b","b","b","b"]
// 输出:返回 4 ,输入数组的前 4 个字符应该是:["a","b","1","2"]。
// 解释:
// 由于字符 "a" 不重复,所以不会被压缩。"bbbbbbbbbbbb" 被 “b12” 替代。
// 注意每个数字在数组中都有它自己的位置。
//
// 提示:
// 1 <= chars.length <= 2000
// chars[i] 可以是小写英文字母、大写英文字母、数字或符号
/**
* @param {character[]} chars
* @return {number}
*/
// 注意题干 需 实现一个只使用常量额外空间的算法来解决此问题
// 开辟新数组
var compress = function (chars) {
for (let i = 0; i < chars.length; i++) {
let j = i + 1;
let length = 1;
while (chars[i] == chars[j]) {
j++;
length++;
}
if (length > 1) {
// 将length长度转化为Arr 如 12 =》 ['1','2']
let lengthArr = length.toString().split("");
// 压缩数组
chars.splice(i + 1, length - 1, ...lengthArr);
// 使用splice数组长度会变化此时要控制 i
i += lengthArr.length;
}
}
return chars.length;
};
You can’t perform that action at this time.