Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

feat: update solutions to lc problems #2178

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jan 3, 2024
Merged

feat: update solutions to lc problems #2178

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
58 changes: 20 additions & 38 deletions solution/2400-2499/2487.Remove Nodes From Linked List/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -101,16 +101,13 @@ class Solution:
# self.next = next
class Solution:
def removeNodes(self, head: Optional[ListNode]) -> Optional[ListNode]:
dummy = ListNode(next=head)
dummy = ListNode(inf, head)
cur = head
stk = []
stk = [dummy]
while cur:
while stk and stk[-1].val < cur.val:
while stk[-1].val < cur.val:
stk.pop()
if stk:
stk[-1].next = cur
else:
dummy.next = cur
stk[-1].next = cur
stk.append(cur)
cur = cur.next
return dummy.next
Expand Down Expand Up @@ -169,17 +166,14 @@ class Solution {
*/
class Solution {
public ListNode removeNodes(ListNode head) {
ListNode dummy = new ListNode(0, head);
ListNode dummy = new ListNode(1 << 30, head);
Deque<ListNode> stk = new ArrayDeque<>();
stk.offerLast(dummy);
for (ListNode cur = head; cur != null; cur = cur.next) {
while (!stk.isEmpty() && stk.peekLast().val < cur.val) {
while (stk.peekLast().val < cur.val) {
stk.pollLast();
}
if (!stk.isEmpty()) {
stk.peekLast().next = cur;
} else {
dummy.next = cur;
}
stk.peekLast().next = cur;
stk.offerLast(cur);
}
return dummy.next;
Expand Down Expand Up @@ -240,18 +234,14 @@ public:
class Solution {
public:
ListNode* removeNodes(ListNode* head) {
ListNode* dummy = new ListNode(0, head);
ListNode* dummy = new ListNode(1e9, head);
ListNode* cur = head;
vector<ListNode*> stk;
vector<ListNode*> stk = {dummy};
for (ListNode* cur = head; cur; cur = cur->next) {
while (stk.size() && stk.back()->val < cur->val) {
while (stk.back()->val < cur->val) {
stk.pop_back();
}
if (stk.size()) {
stk.back()->next = cur;
} else {
dummy->next = cur;
}
stk.back()->next = cur;
stk.push_back(cur);
}
return dummy->next;
Expand Down Expand Up @@ -301,17 +291,13 @@ func removeNodes(head *ListNode) *ListNode {
* }
*/
func removeNodes(head *ListNode) *ListNode {
dummy := &ListNode{Next: head}
stk := []*ListNode{}
dummy := &ListNode{1 << 30, head}
stk := []*ListNode{dummy}
for cur := head; cur != nil; cur = cur.Next {
for len(stk) > 0 && stk[len(stk)-1].Val < cur.Val {
for stk[len(stk)-1].Val < cur.Val {
stk = stk[:len(stk)-1]
}
if len(stk) > 0 {
stk[len(stk)-1].Next = cur
} else {
dummy.Next = cur
}
stk[len(stk)-1].Next = cur
stk = append(stk, cur)
}
return dummy.Next
Expand Down Expand Up @@ -369,17 +355,13 @@ function removeNodes(head: ListNode | null): ListNode | null {
*/

function removeNodes(head: ListNode | null): ListNode | null {
const dummy = new ListNode(0, head);
const stk: ListNode[] = [];
const dummy = new ListNode(Infinity, head);
const stk: ListNode[] = [dummy];
for (let cur = head; cur; cur = cur.next) {
while (stk.length && stk.at(-1)!.val < cur.val) {
while (stk.at(-1)!.val < cur.val) {
stk.pop();
}
if (stk.length) {
stk.at(-1)!.next = cur;
} else {
dummy.next = cur;
}
stk.at(-1)!.next = cur;
stk.push(cur);
}
return dummy.next;
Expand Down
58 changes: 20 additions & 38 deletions solution/2400-2499/2487.Remove Nodes From Linked List/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -91,16 +91,13 @@ class Solution:
# self.next = next
class Solution:
def removeNodes(self, head: Optional[ListNode]) -> Optional[ListNode]:
dummy = ListNode(next=head)
dummy = ListNode(inf, head)
cur = head
stk = []
stk = [dummy]
while cur:
while stk and stk[-1].val < cur.val:
while stk[-1].val < cur.val:
stk.pop()
if stk:
stk[-1].next = cur
else:
dummy.next = cur
stk[-1].next = cur
stk.append(cur)
cur = cur.next
return dummy.next
Expand Down Expand Up @@ -157,17 +154,14 @@ class Solution {
*/
class Solution {
public ListNode removeNodes(ListNode head) {
ListNode dummy = new ListNode(0, head);
ListNode dummy = new ListNode(1 << 30, head);
Deque<ListNode> stk = new ArrayDeque<>();
stk.offerLast(dummy);
for (ListNode cur = head; cur != null; cur = cur.next) {
while (!stk.isEmpty() && stk.peekLast().val < cur.val) {
while (stk.peekLast().val < cur.val) {
stk.pollLast();
}
if (!stk.isEmpty()) {
stk.peekLast().next = cur;
} else {
dummy.next = cur;
}
stk.peekLast().next = cur;
stk.offerLast(cur);
}
return dummy.next;
Expand Down Expand Up @@ -228,18 +222,14 @@ public:
class Solution {
public:
ListNode* removeNodes(ListNode* head) {
ListNode* dummy = new ListNode(0, head);
ListNode* dummy = new ListNode(1e9, head);
ListNode* cur = head;
vector<ListNode*> stk;
vector<ListNode*> stk = {dummy};
for (ListNode* cur = head; cur; cur = cur->next) {
while (stk.size() && stk.back()->val < cur->val) {
while (stk.back()->val < cur->val) {
stk.pop_back();
}
if (stk.size()) {
stk.back()->next = cur;
} else {
dummy->next = cur;
}
stk.back()->next = cur;
stk.push_back(cur);
}
return dummy->next;
Expand Down Expand Up @@ -289,17 +279,13 @@ func removeNodes(head *ListNode) *ListNode {
* }
*/
func removeNodes(head *ListNode) *ListNode {
dummy := &ListNode{Next: head}
stk := []*ListNode{}
dummy := &ListNode{1 << 30, head}
stk := []*ListNode{dummy}
for cur := head; cur != nil; cur = cur.Next {
for len(stk) > 0 && stk[len(stk)-1].Val < cur.Val {
for stk[len(stk)-1].Val < cur.Val {
stk = stk[:len(stk)-1]
}
if len(stk) > 0 {
stk[len(stk)-1].Next = cur
} else {
dummy.Next = cur
}
stk[len(stk)-1].Next = cur
stk = append(stk, cur)
}
return dummy.Next
Expand Down Expand Up @@ -357,17 +343,13 @@ function removeNodes(head: ListNode | null): ListNode | null {
*/

function removeNodes(head: ListNode | null): ListNode | null {
const dummy = new ListNode(0, head);
const stk: ListNode[] = [];
const dummy = new ListNode(Infinity, head);
const stk: ListNode[] = [dummy];
for (let cur = head; cur; cur = cur.next) {
while (stk.length && stk.at(-1)!.val < cur.val) {
while (stk.at(-1)!.val < cur.val) {
stk.pop();
}
if (stk.length) {
stk.at(-1)!.next = cur;
} else {
dummy.next = cur;
}
stk.at(-1)!.next = cur;
stk.push(cur);
}
return dummy.next;
Expand Down
58 changes: 25 additions & 33 deletions solution/2400-2499/2487.Remove Nodes From Linked List/Solution.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,34 +1,26 @@
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeNodes(ListNode* head) {
vector<int> nums;
while (head) {
nums.emplace_back(head->val);
head = head->next;
}
vector<int> stk;
for (int v : nums) {
while (!stk.empty() && stk.back() < v) {
stk.pop_back();
}
stk.push_back(v);
}
ListNode* dummy = new ListNode();
head = dummy;
for (int v : stk) {
head->next = new ListNode(v);
head = head->next;
}
return dummy->next;
}
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeNodes(ListNode* head) {
ListNode* dummy = new ListNode(1e9, head);
ListNode* cur = head;
vector<ListNode*> stk = {dummy};
for (ListNode* cur = head; cur; cur = cur->next) {
while (stk.back()->val < cur->val) {
stk.pop_back();
}
stk.back()->next = cur;
stk.push_back(cur);
}
return dummy->next;
}
};
21 changes: 6 additions & 15 deletions solution/2400-2499/2487.Remove Nodes From Linked List/Solution.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,23 +6,14 @@
* }
*/
func removeNodes(head *ListNode) *ListNode {
nums := []int{}
for head != nil {
nums = append(nums, head.Val)
head = head.Next
}
stk := []int{}
for _, v := range nums {
for len(stk) > 0 && stk[len(stk)-1] < v {
dummy := &ListNode{1 << 30, head}
stk := []*ListNode{dummy}
for cur := head; cur != nil; cur = cur.Next {
for stk[len(stk)-1].Val < cur.Val {
stk = stk[:len(stk)-1]
}
stk = append(stk, v)
}
dummy := &ListNode{}
head = dummy
for _, v := range stk {
head.Next = &ListNode{Val: v}
head = head.Next
stk[len(stk)-1].Next = cur
stk = append(stk, cur)
}
return dummy.Next
}
22 changes: 7 additions & 15 deletions solution/2400-2499/2487.Remove Nodes From Linked List/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,23 +10,15 @@
*/
class Solution {
public ListNode removeNodes(ListNode head) {
List<Integer> nums = new ArrayList<>();
while (head != null) {
nums.add(head.val);
head = head.next;
}
Deque<Integer> stk = new ArrayDeque<>();
for (int v : nums) {
while (!stk.isEmpty() && stk.peekLast() < v) {
ListNode dummy = new ListNode(1 << 30, head);
Deque<ListNode> stk = new ArrayDeque<>();
stk.offerLast(dummy);
for (ListNode cur = head; cur != null; cur = cur.next) {
while (stk.peekLast().val < cur.val) {
stk.pollLast();
}
stk.offerLast(v);
}
ListNode dummy = new ListNode();
head = dummy;
while (!stk.isEmpty()) {
head.next = new ListNode(stk.pollFirst());
head = head.next;
stk.peekLast().next = cur;
stk.offerLast(cur);
}
return dummy.next;
}
Expand Down
39 changes: 17 additions & 22 deletions solution/2400-2499/2487.Remove Nodes From Linked List/Solution.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,22 +1,17 @@
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def removeNodes(self, head: Optional[ListNode]) -> Optional[ListNode]:
nums = []
while head:
nums.append(head.val)
head = head.next
stk = []
for v in nums:
while stk and stk[-1] < v:
stk.pop()
stk.append(v)
dummy = ListNode()
head = dummy
for v in stk:
head.next = ListNode(v)
head = head.next
return dummy.next
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def removeNodes(self, head: Optional[ListNode]) -> Optional[ListNode]:
dummy = ListNode(inf, head)
cur = head
stk = [dummy]
while cur:
while stk[-1].val < cur.val:
stk.pop()
stk[-1].next = cur
stk.append(cur)
cur = cur.next
return dummy.next
Loading