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 }}
ecmadao
algorithms
Repository navigation
Code
Issues
1
(1)
Pull requests
2
(2)
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
algorithms
/
leetcode
/
JavaScript
/
No148.sort-list.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
71 lines (62 loc) · 1.73 KB
master
Breadcrumbs
algorithms
/
leetcode
/
JavaScript
/
No148.sort-list.js
Copy path
Top
File metadata and controls
Code
Blame
71 lines (62 loc) · 1.73 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
/**
* Difficulty:
* Medium
*
* Desc:
* Sort a linked list in O(n log n) time using constant space complexity.
*
* 给一个链表按照从小到大的顺序排序
*/
/**
* 相对于给数组排序,链表的最大问题在于我们无法通过索引快速的获取到链表中的某个节点
* 因此,首先想到的就是 merge sort, 归并排序,每次只需要获取到链表的中间位置
* 如何快速获取到链表的中间位置呢?
* 可以创建一个 fast 索引,一个 slow 索引,然后两者向后遍历
* 但每次 fast 索引向后走的步长是 slow 的两倍。因此,当 fast 到达链表的结尾处时,slow 正好处于中间位置
*/
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
var merge = function(list1, list2) {
if (!list1 && list2) return null;
var list = new ListNode(null);
var current = list;
while(list1 && list2) {
if (list1.val < list2.val) {
current.next = list1;
list1 = list1.next;
} else {
current.next = list2;
list2= list2.next;
}
current = current.next;
}
if (list1) {
current.next = list1;
} else if (list2) {
current.next = list2;
}
return list.next;
};
/**
* @param {ListNode} head
* @return {ListNode}
*/
var sortList = function(head) {
if (!head || !head.next) return head;
var slow = head;
var fast = head;
// 每次 fast 索引向后走的步长是 slow 的两倍。
// 当 fast 到达链表的结尾处时,slow 正好处于中间位置
while(fast.next && fast.next.next) {
fast = fast.next.next;
slow = slow.next;
}
fast = slow.next;
slow.next = null;
return merge(sortList(head), sortList(fast));
};
You can’t perform that action at this time.