Skip to content

Use dataclasses in circular_linked_list.py#10884

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
tianyizheng02 merged 2 commits into from
Oct 24, 2023
Merged

Use dataclasses in circular_linked_list.py #10884

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
65058a0
Use dataclasses in circular_linked_list.py
cclauss Oct 24, 2023
135a590
updating DIRECTORY.md
Oct 24, 2023
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
2 changes: 2 additions & 0 deletions DIRECTORY.md
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -157,6 +157,7 @@
* [Prefix Conversions](conversions/prefix_conversions.py)
* [Prefix Conversions String](conversions/prefix_conversions_string.py)
* [Pressure Conversions](conversions/pressure_conversions.py)
* [Rgb Cmyk Conversion](conversions/rgb_cmyk_conversion.py)
* [Rgb Hsv Conversion](conversions/rgb_hsv_conversion.py)
* [Roman Numerals](conversions/roman_numerals.py)
* [Speed Conversions](conversions/speed_conversions.py)
Expand DownExpand Up@@ -198,6 +199,7 @@
* [Lowest Common Ancestor](data_structures/binary_tree/lowest_common_ancestor.py)
* [Maximum Fenwick Tree](data_structures/binary_tree/maximum_fenwick_tree.py)
* [Merge Two Binary Trees](data_structures/binary_tree/merge_two_binary_trees.py)
* [Mirror Binary Tree](data_structures/binary_tree/mirror_binary_tree.py)
* [Non Recursive Segment Tree](data_structures/binary_tree/non_recursive_segment_tree.py)
* [Number Of Possible Binary Trees](data_structures/binary_tree/number_of_possible_binary_trees.py)
* [Red Black Tree](data_structures/binary_tree/red_black_tree.py)
Expand Down
49 changes: 21 additions & 28 deletions data_structures/linked_list/circular_linked_list.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -1,27 +1,20 @@
from __future__ import annotations

from collections.abc import Iterator
from dataclasses import dataclass
from typing import Any


@dataclass
class Node:
def __init__(self, data: Any):
"""
Initialize a new Node with the given data.
Args:
data: The data to be stored in the node.
"""
self.data: Any = data
self.next: Node | None = None # Reference to the next node
data: Any
next_node: Node | None = None


@dataclass
class CircularLinkedList:
def __init__(self) -> None:
"""
Initialize an empty Circular Linked List.
"""
self.head: Node | None = None # Reference to the head (first node)
self.tail: Node | None = None # Reference to the tail (last node)
head: Node | None = None # Reference to the head (first node)
tail: Node | None = None # Reference to the tail (last node)

def __iter__(self) -> Iterator[Any]:
"""
Expand All@@ -32,7 +25,7 @@ def __iter__(self) -> Iterator[Any]:
node = self.head
while node:
yield node.data
node = node.next
node = node.next_node
if node == self.head:
break

Expand DownExpand Up@@ -76,20 +69,20 @@ def insert_nth(self, index: int, data: Any) -> None:
raise IndexError("list index out of range.")
new_node: Node = Node(data)
if self.head is None:
new_node.next = new_node # First node points to itself
new_node.next_node = new_node # First node points to itself
self.tail = self.head = new_node
elif index == 0: # Insert at the head
new_node.next = self.head
new_node.next_node = self.head
assert self.tail is not None # List is not empty, tail exists
self.head = self.tail.next = new_node
self.head = self.tail.next_node = new_node
else:
temp: Node | None = self.head
for _ in range(index - 1):
assert temp is not None
temp = temp.next
temp = temp.next_node
assert temp is not None
new_node.next = temp.next
temp.next = new_node
new_node.next_node = temp.next_node
temp.next_node = new_node
if index == len(self) - 1: # Insert at the tail
self.tail = new_node

Expand DownExpand Up@@ -130,18 +123,18 @@ def delete_nth(self, index: int = 0) -> Any:
if self.head == self.tail: # Just one node
self.head = self.tail = None
elif index == 0: # Delete head node
assert self.tail.next is not None
self.tail.next = self.tail.next.next
self.head = self.head.next
assert self.tail.next_node is not None
self.tail.next_node = self.tail.next_node.next_node
self.head = self.head.next_node
else:
temp: Node | None = self.head
for _ in range(index - 1):
assert temp is not None
temp = temp.next
temp = temp.next_node
assert temp is not None
assert temp.next is not None
delete_node = temp.next
temp.next = temp.next.next
assert temp.next_node is not None
delete_node = temp.next_node
temp.next_node = temp.next_node.next_node
if index == len(self) - 1: # Delete at tail
self.tail = temp
return delete_node.data
Expand Down
, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all 
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
Use dataclasses in circular_linked_list.py by cclauss · Pull Request #10884 · TheAlgorithms/Python · GitHub
Skip to content
Use dataclasses in circular_linked_list.py#10884

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

tianyizheng02
merged 2 commits into

from

Oct 24, 2023
 Merged


Use dataclasses in circular_linked_list.py
#10884
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


2 commits


Select commit
Hold shift + click to select a range
65058a0

Use dataclasses in circular_linked_list.py


cclauss Oct 24, 2023
135a590

updating DIRECTORY.md

Oct 24, 2023

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


2 changes: 2 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -157,6 +157,7 @@
 * [Prefix Conversions](conversions/prefix_conversions.py)
 * [Prefix Conversions String](conversions/prefix_conversions_string.py)
 * [Pressure Conversions](conversions/pressure_conversions.py)
 * [Rgb Cmyk Conversion](conversions/rgb_cmyk_conversion.py)
 * [Rgb Hsv Conversion](conversions/rgb_hsv_conversion.py)
 * [Roman Numerals](conversions/roman_numerals.py)
 * [Speed Conversions](conversions/speed_conversions.py)
Expand DownExpand Up@@ -198,6 +199,7 @@
 * [Lowest Common Ancestor](data_structures/binary_tree/lowest_common_ancestor.py)
 * [Maximum Fenwick Tree](data_structures/binary_tree/maximum_fenwick_tree.py)
 * [Merge Two Binary Trees](data_structures/binary_tree/merge_two_binary_trees.py)
 * [Mirror Binary Tree](data_structures/binary_tree/mirror_binary_tree.py)
 * [Non Recursive Segment Tree](data_structures/binary_tree/non_recursive_segment_tree.py)
 * [Number Of Possible Binary Trees](data_structures/binary_tree/number_of_possible_binary_trees.py)
 * [Red Black Tree](data_structures/binary_tree/red_black_tree.py)
Expand Down

49 changes: 21 additions & 28 deletions
data_structures/linked_list/circular_linked_list.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,27 +1,20 @@
from __future__ import annotations

from collections.abc import Iterator
from dataclasses import dataclass
from typing import Any


@dataclass
class Node:
 def __init__(self, data: Any):
 """
 Initialize a new Node with the given data.
 Args:
 data: The data to be stored in the node.
 """
 self.data: Any = data
 self.next: Node | None = None # Reference to the next node
 data: Any
 next_node: Node | None = None


@dataclass
class CircularLinkedList:
 def __init__(self) -> None:
 """
 Initialize an empty Circular Linked List.
 """
 self.head: Node | None = None # Reference to the head (first node)
 self.tail: Node | None = None # Reference to the tail (last node)
 head: Node | None = None # Reference to the head (first node)
 tail: Node | None = None # Reference to the tail (last node)

 def __iter__(self) -> Iterator[Any]:
 """
Expand All@@ -32,7 +25,7 @@ def __iter__(self) -> Iterator[Any]:
 node = self.head
 while node:
 yield node.data
 node = node.next
 node = node.next_node
 if node == self.head:
 break

Expand DownExpand Up@@ -76,20 +69,20 @@ def insert_nth(self, index: int, data: Any) -> None:
 raise IndexError("list index out of range.")
 new_node: Node = Node(data)
 if self.head is None:
 new_node.next = new_node # First node points to itself
 new_node.next_node = new_node # First node points to itself
 self.tail = self.head = new_node
 elif index == 0: # Insert at the head
 new_node.next = self.head
 new_node.next_node = self.head
 assert self.tail is not None # List is not empty, tail exists
 self.head = self.tail.next = new_node
 self.head = self.tail.next_node = new_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 new_node.next = temp.next
 temp.next = new_node
 new_node.next_node = temp.next_node
 temp.next_node = new_node
 if index == len(self) - 1: # Insert at the tail
 self.tail = new_node

Expand DownExpand Up@@ -130,18 +123,18 @@ def delete_nth(self, index: int = 0) -> Any:
 if self.head == self.tail: # Just one node
 self.head = self.tail = None
 elif index == 0: # Delete head node
 assert self.tail.next is not None
 self.tail.next = self.tail.next.next
 self.head = self.head.next
 assert self.tail.next_node is not None
 self.tail.next_node = self.tail.next_node.next_node
 self.head = self.head.next_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 assert temp.next is not None
 delete_node = temp.next
 temp.next = temp.next.next
 assert temp.next_node is not None
 delete_node = temp.next_node
 temp.next_node = temp.next_node.next_node
 if index == len(self) - 1: # Delete at tail
 self.tail = temp
 return delete_node.data
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Force GitHub README to respect dark mode
(function() {
var style = document.createElement('style');
style.textContent = '
.markdown-body {
color-scheme: dark light;
}
.markdown-body pre { background: #161b22 !important; }
.markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }
.markdown-body table th, .markdown-body table td { border-color: #30363d !important; }
.markdown-body img { background: #0d1117; }
.markdown-body blockquote { border-left-color: #8b949e; }
.markdown-body hr { border-color: #30363d; }
';
document.head.appendChild(style);
})();
}
} catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Use dataclasses in circular_linked_list.py by cclauss · Pull Request #10884 · TheAlgorithms/Python · GitHub
Skip to content
Use dataclasses in circular_linked_list.py#10884

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

tianyizheng02
merged 2 commits into

from

Oct 24, 2023
 Merged


Use dataclasses in circular_linked_list.py
#10884
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


2 commits


Select commit
Hold shift + click to select a range
65058a0

Use dataclasses in circular_linked_list.py


cclauss Oct 24, 2023
135a590

updating DIRECTORY.md

Oct 24, 2023

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


2 changes: 2 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -157,6 +157,7 @@
 * [Prefix Conversions](conversions/prefix_conversions.py)
 * [Prefix Conversions String](conversions/prefix_conversions_string.py)
 * [Pressure Conversions](conversions/pressure_conversions.py)
 * [Rgb Cmyk Conversion](conversions/rgb_cmyk_conversion.py)
 * [Rgb Hsv Conversion](conversions/rgb_hsv_conversion.py)
 * [Roman Numerals](conversions/roman_numerals.py)
 * [Speed Conversions](conversions/speed_conversions.py)
Expand DownExpand Up@@ -198,6 +199,7 @@
 * [Lowest Common Ancestor](data_structures/binary_tree/lowest_common_ancestor.py)
 * [Maximum Fenwick Tree](data_structures/binary_tree/maximum_fenwick_tree.py)
 * [Merge Two Binary Trees](data_structures/binary_tree/merge_two_binary_trees.py)
 * [Mirror Binary Tree](data_structures/binary_tree/mirror_binary_tree.py)
 * [Non Recursive Segment Tree](data_structures/binary_tree/non_recursive_segment_tree.py)
 * [Number Of Possible Binary Trees](data_structures/binary_tree/number_of_possible_binary_trees.py)
 * [Red Black Tree](data_structures/binary_tree/red_black_tree.py)
Expand Down

49 changes: 21 additions & 28 deletions
data_structures/linked_list/circular_linked_list.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,27 +1,20 @@
from __future__ import annotations

from collections.abc import Iterator
from dataclasses import dataclass
from typing import Any


@dataclass
class Node:
 def __init__(self, data: Any):
 """
 Initialize a new Node with the given data.
 Args:
 data: The data to be stored in the node.
 """
 self.data: Any = data
 self.next: Node | None = None # Reference to the next node
 data: Any
 next_node: Node | None = None


@dataclass
class CircularLinkedList:
 def __init__(self) -> None:
 """
 Initialize an empty Circular Linked List.
 """
 self.head: Node | None = None # Reference to the head (first node)
 self.tail: Node | None = None # Reference to the tail (last node)
 head: Node | None = None # Reference to the head (first node)
 tail: Node | None = None # Reference to the tail (last node)

 def __iter__(self) -> Iterator[Any]:
 """
Expand All@@ -32,7 +25,7 @@ def __iter__(self) -> Iterator[Any]:
 node = self.head
 while node:
 yield node.data
 node = node.next
 node = node.next_node
 if node == self.head:
 break

Expand DownExpand Up@@ -76,20 +69,20 @@ def insert_nth(self, index: int, data: Any) -> None:
 raise IndexError("list index out of range.")
 new_node: Node = Node(data)
 if self.head is None:
 new_node.next = new_node # First node points to itself
 new_node.next_node = new_node # First node points to itself
 self.tail = self.head = new_node
 elif index == 0: # Insert at the head
 new_node.next = self.head
 new_node.next_node = self.head
 assert self.tail is not None # List is not empty, tail exists
 self.head = self.tail.next = new_node
 self.head = self.tail.next_node = new_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 new_node.next = temp.next
 temp.next = new_node
 new_node.next_node = temp.next_node
 temp.next_node = new_node
 if index == len(self) - 1: # Insert at the tail
 self.tail = new_node

Expand DownExpand Up@@ -130,18 +123,18 @@ def delete_nth(self, index: int = 0) -> Any:
 if self.head == self.tail: # Just one node
 self.head = self.tail = None
 elif index == 0: # Delete head node
 assert self.tail.next is not None
 self.tail.next = self.tail.next.next
 self.head = self.head.next
 assert self.tail.next_node is not None
 self.tail.next_node = self.tail.next_node.next_node
 self.head = self.head.next_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 assert temp.next is not None
 delete_node = temp.next
 temp.next = temp.next.next
 assert temp.next_node is not None
 delete_node = temp.next_node
 temp.next_node = temp.next_node.next_node
 if index == len(self) - 1: # Delete at tail
 self.tail = temp
 return delete_node.data
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Highlight search terms from Google/DuckDuckGo/Bing referrer
(function() {
var ref = document.referrer;
var terms = [];
if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {
var url = new URL(ref);
var q = url.searchParams.get('q') || url.searchParams.get('p');
if (q) {
terms = q.split(/\s+/).filter(function(t) { return t.length > 2; });
}
}
if (terms.length === 0) return;
var style = document.createElement('style');
style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';
document.head.appendChild(style);
function highlight(node) {
if (node.nodeType === 3) { // text node
var text = node.textContent;
var found = false;
terms.forEach(function(term) {
var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi');
if (regex.test(text)) {
found = true;
var frag = document.createDocumentFragment();
var parts = text.split(regex);
parts.forEach(function(part, i) {
if (i % 2 === 0) {
frag.appendChild(document.createTextNode(part));
} else {
var span = document.createElement('span');
span.className = 'userscript-highlight';
span.textContent = part;
frag.appendChild(span);
}
});
node.parentNode.replaceChild(frag, node);
}
});
} else if (node.nodeType === 1 && node.childNodes) { // element
var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];
if (!skipTags.includes(node.tagName)) {
Array.from(node.childNodes).forEach(highlight);
}
}
}
highlight(document.body);
// Re-highlight on dynamic content
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1 || node.nodeType === 3) highlight(node);
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Use dataclasses in circular_linked_list.py by cclauss · Pull Request #10884 · TheAlgorithms/Python · GitHub
Skip to content
Use dataclasses in circular_linked_list.py#10884

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

tianyizheng02
merged 2 commits into

from

Oct 24, 2023
 Merged


Use dataclasses in circular_linked_list.py
#10884
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


2 commits


Select commit
Hold shift + click to select a range
65058a0

Use dataclasses in circular_linked_list.py


cclauss Oct 24, 2023
135a590

updating DIRECTORY.md

Oct 24, 2023

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


2 changes: 2 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -157,6 +157,7 @@
 * [Prefix Conversions](conversions/prefix_conversions.py)
 * [Prefix Conversions String](conversions/prefix_conversions_string.py)
 * [Pressure Conversions](conversions/pressure_conversions.py)
 * [Rgb Cmyk Conversion](conversions/rgb_cmyk_conversion.py)
 * [Rgb Hsv Conversion](conversions/rgb_hsv_conversion.py)
 * [Roman Numerals](conversions/roman_numerals.py)
 * [Speed Conversions](conversions/speed_conversions.py)
Expand DownExpand Up@@ -198,6 +199,7 @@
 * [Lowest Common Ancestor](data_structures/binary_tree/lowest_common_ancestor.py)
 * [Maximum Fenwick Tree](data_structures/binary_tree/maximum_fenwick_tree.py)
 * [Merge Two Binary Trees](data_structures/binary_tree/merge_two_binary_trees.py)
 * [Mirror Binary Tree](data_structures/binary_tree/mirror_binary_tree.py)
 * [Non Recursive Segment Tree](data_structures/binary_tree/non_recursive_segment_tree.py)
 * [Number Of Possible Binary Trees](data_structures/binary_tree/number_of_possible_binary_trees.py)
 * [Red Black Tree](data_structures/binary_tree/red_black_tree.py)
Expand Down

49 changes: 21 additions & 28 deletions
data_structures/linked_list/circular_linked_list.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,27 +1,20 @@
from __future__ import annotations

from collections.abc import Iterator
from dataclasses import dataclass
from typing import Any


@dataclass
class Node:
 def __init__(self, data: Any):
 """
 Initialize a new Node with the given data.
 Args:
 data: The data to be stored in the node.
 """
 self.data: Any = data
 self.next: Node | None = None # Reference to the next node
 data: Any
 next_node: Node | None = None


@dataclass
class CircularLinkedList:
 def __init__(self) -> None:
 """
 Initialize an empty Circular Linked List.
 """
 self.head: Node | None = None # Reference to the head (first node)
 self.tail: Node | None = None # Reference to the tail (last node)
 head: Node | None = None # Reference to the head (first node)
 tail: Node | None = None # Reference to the tail (last node)

 def __iter__(self) -> Iterator[Any]:
 """
Expand All@@ -32,7 +25,7 @@ def __iter__(self) -> Iterator[Any]:
 node = self.head
 while node:
 yield node.data
 node = node.next
 node = node.next_node
 if node == self.head:
 break

Expand DownExpand Up@@ -76,20 +69,20 @@ def insert_nth(self, index: int, data: Any) -> None:
 raise IndexError("list index out of range.")
 new_node: Node = Node(data)
 if self.head is None:
 new_node.next = new_node # First node points to itself
 new_node.next_node = new_node # First node points to itself
 self.tail = self.head = new_node
 elif index == 0: # Insert at the head
 new_node.next = self.head
 new_node.next_node = self.head
 assert self.tail is not None # List is not empty, tail exists
 self.head = self.tail.next = new_node
 self.head = self.tail.next_node = new_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 new_node.next = temp.next
 temp.next = new_node
 new_node.next_node = temp.next_node
 temp.next_node = new_node
 if index == len(self) - 1: # Insert at the tail
 self.tail = new_node

Expand DownExpand Up@@ -130,18 +123,18 @@ def delete_nth(self, index: int = 0) -> Any:
 if self.head == self.tail: # Just one node
 self.head = self.tail = None
 elif index == 0: # Delete head node
 assert self.tail.next is not None
 self.tail.next = self.tail.next.next
 self.head = self.head.next
 assert self.tail.next_node is not None
 self.tail.next_node = self.tail.next_node.next_node
 self.head = self.head.next_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 assert temp.next is not None
 delete_node = temp.next
 temp.next = temp.next.next
 assert temp.next_node is not None
 delete_node = temp.next_node
 temp.next_node = temp.next_node.next_node
 if index == len(self) - 1: # Delete at tail
 self.tail = temp
 return delete_node.data
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Strip utm_, fbclid, gclid, etc. from all links on page
(function() {
var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',
'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',
'ref', 'ref_src', 'source', 'medium', 'campaign'];
function cleanUrl(url) {
try {
var u = new URL(url, window.location.origin);
var changed = false;
trackingParams.forEach(function(p) {
if (u.searchParams.has(p)) {
u.searchParams.delete(p);
changed = true;
}
});
return changed ? u.toString() : url;
} catch (e) {
return url;
}
}
function cleanLinks() {
document.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
cleanLinks();
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1) {
if (node.tagName === 'A') cleanLinks();
node.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); }
})();
(function(){
try {
var __m = "youtube.com";
var __re = new RegExp('^' + "youtube\\.com" + '
Use dataclasses in circular_linked_list.py by cclauss · Pull Request #10884 · TheAlgorithms/Python · GitHub
Skip to content
Use dataclasses in circular_linked_list.py#10884

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

tianyizheng02
merged 2 commits into

from

Oct 24, 2023
 Merged


Use dataclasses in circular_linked_list.py
#10884
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


2 commits


Select commit
Hold shift + click to select a range
65058a0

Use dataclasses in circular_linked_list.py


cclauss Oct 24, 2023
135a590

updating DIRECTORY.md

Oct 24, 2023

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


2 changes: 2 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -157,6 +157,7 @@
 * [Prefix Conversions](conversions/prefix_conversions.py)
 * [Prefix Conversions String](conversions/prefix_conversions_string.py)
 * [Pressure Conversions](conversions/pressure_conversions.py)
 * [Rgb Cmyk Conversion](conversions/rgb_cmyk_conversion.py)
 * [Rgb Hsv Conversion](conversions/rgb_hsv_conversion.py)
 * [Roman Numerals](conversions/roman_numerals.py)
 * [Speed Conversions](conversions/speed_conversions.py)
Expand DownExpand Up@@ -198,6 +199,7 @@
 * [Lowest Common Ancestor](data_structures/binary_tree/lowest_common_ancestor.py)
 * [Maximum Fenwick Tree](data_structures/binary_tree/maximum_fenwick_tree.py)
 * [Merge Two Binary Trees](data_structures/binary_tree/merge_two_binary_trees.py)
 * [Mirror Binary Tree](data_structures/binary_tree/mirror_binary_tree.py)
 * [Non Recursive Segment Tree](data_structures/binary_tree/non_recursive_segment_tree.py)
 * [Number Of Possible Binary Trees](data_structures/binary_tree/number_of_possible_binary_trees.py)
 * [Red Black Tree](data_structures/binary_tree/red_black_tree.py)
Expand Down

49 changes: 21 additions & 28 deletions
data_structures/linked_list/circular_linked_list.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,27 +1,20 @@
from __future__ import annotations

from collections.abc import Iterator
from dataclasses import dataclass
from typing import Any


@dataclass
class Node:
 def __init__(self, data: Any):
 """
 Initialize a new Node with the given data.
 Args:
 data: The data to be stored in the node.
 """
 self.data: Any = data
 self.next: Node | None = None # Reference to the next node
 data: Any
 next_node: Node | None = None


@dataclass
class CircularLinkedList:
 def __init__(self) -> None:
 """
 Initialize an empty Circular Linked List.
 """
 self.head: Node | None = None # Reference to the head (first node)
 self.tail: Node | None = None # Reference to the tail (last node)
 head: Node | None = None # Reference to the head (first node)
 tail: Node | None = None # Reference to the tail (last node)

 def __iter__(self) -> Iterator[Any]:
 """
Expand All@@ -32,7 +25,7 @@ def __iter__(self) -> Iterator[Any]:
 node = self.head
 while node:
 yield node.data
 node = node.next
 node = node.next_node
 if node == self.head:
 break

Expand DownExpand Up@@ -76,20 +69,20 @@ def insert_nth(self, index: int, data: Any) -> None:
 raise IndexError("list index out of range.")
 new_node: Node = Node(data)
 if self.head is None:
 new_node.next = new_node # First node points to itself
 new_node.next_node = new_node # First node points to itself
 self.tail = self.head = new_node
 elif index == 0: # Insert at the head
 new_node.next = self.head
 new_node.next_node = self.head
 assert self.tail is not None # List is not empty, tail exists
 self.head = self.tail.next = new_node
 self.head = self.tail.next_node = new_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 new_node.next = temp.next
 temp.next = new_node
 new_node.next_node = temp.next_node
 temp.next_node = new_node
 if index == len(self) - 1: # Insert at the tail
 self.tail = new_node

Expand DownExpand Up@@ -130,18 +123,18 @@ def delete_nth(self, index: int = 0) -> Any:
 if self.head == self.tail: # Just one node
 self.head = self.tail = None
 elif index == 0: # Delete head node
 assert self.tail.next is not None
 self.tail.next = self.tail.next.next
 self.head = self.head.next
 assert self.tail.next_node is not None
 self.tail.next_node = self.tail.next_node.next_node
 self.head = self.head.next_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 assert temp.next is not None
 delete_node = temp.next
 temp.next = temp.next.next
 assert temp.next_node is not None
 delete_node = temp.next_node
 temp.next_node = temp.next_node.next_node
 if index == len(self) - 1: # Delete at tail
 self.tail = temp
 return delete_node.data
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Auto-enable theater mode on YouTube
(function() {
function tryTheater() {
var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]');
if (btn && !btn.classList.contains('activated')) {
btn.click();
}
}
// Try immediately
tryTheater();
// Try after navigation (SPA)
var lastUrl = location.href;
setInterval(function() {
if (location.href !== lastUrl) {
lastUrl = location.href;
setTimeout(tryTheater, 500);
}
}, 1000);
// Also try on player load
var observer = new MutationObserver(tryTheater);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Use dataclasses in circular_linked_list.py by cclauss · Pull Request #10884 · TheAlgorithms/Python · GitHub
Skip to content
Use dataclasses in circular_linked_list.py#10884

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

tianyizheng02
merged 2 commits into

from

Oct 24, 2023
 Merged


Use dataclasses in circular_linked_list.py
#10884
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


2 commits


Select commit
Hold shift + click to select a range
65058a0

Use dataclasses in circular_linked_list.py


cclauss Oct 24, 2023
135a590

updating DIRECTORY.md

Oct 24, 2023

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


2 changes: 2 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -157,6 +157,7 @@
 * [Prefix Conversions](conversions/prefix_conversions.py)
 * [Prefix Conversions String](conversions/prefix_conversions_string.py)
 * [Pressure Conversions](conversions/pressure_conversions.py)
 * [Rgb Cmyk Conversion](conversions/rgb_cmyk_conversion.py)
 * [Rgb Hsv Conversion](conversions/rgb_hsv_conversion.py)
 * [Roman Numerals](conversions/roman_numerals.py)
 * [Speed Conversions](conversions/speed_conversions.py)
Expand DownExpand Up@@ -198,6 +199,7 @@
 * [Lowest Common Ancestor](data_structures/binary_tree/lowest_common_ancestor.py)
 * [Maximum Fenwick Tree](data_structures/binary_tree/maximum_fenwick_tree.py)
 * [Merge Two Binary Trees](data_structures/binary_tree/merge_two_binary_trees.py)
 * [Mirror Binary Tree](data_structures/binary_tree/mirror_binary_tree.py)
 * [Non Recursive Segment Tree](data_structures/binary_tree/non_recursive_segment_tree.py)
 * [Number Of Possible Binary Trees](data_structures/binary_tree/number_of_possible_binary_trees.py)
 * [Red Black Tree](data_structures/binary_tree/red_black_tree.py)
Expand Down

49 changes: 21 additions & 28 deletions
data_structures/linked_list/circular_linked_list.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,27 +1,20 @@
from __future__ import annotations

from collections.abc import Iterator
from dataclasses import dataclass
from typing import Any


@dataclass
class Node:
 def __init__(self, data: Any):
 """
 Initialize a new Node with the given data.
 Args:
 data: The data to be stored in the node.
 """
 self.data: Any = data
 self.next: Node | None = None # Reference to the next node
 data: Any
 next_node: Node | None = None


@dataclass
class CircularLinkedList:
 def __init__(self) -> None:
 """
 Initialize an empty Circular Linked List.
 """
 self.head: Node | None = None # Reference to the head (first node)
 self.tail: Node | None = None # Reference to the tail (last node)
 head: Node | None = None # Reference to the head (first node)
 tail: Node | None = None # Reference to the tail (last node)

 def __iter__(self) -> Iterator[Any]:
 """
Expand All@@ -32,7 +25,7 @@ def __iter__(self) -> Iterator[Any]:
 node = self.head
 while node:
 yield node.data
 node = node.next
 node = node.next_node
 if node == self.head:
 break

Expand DownExpand Up@@ -76,20 +69,20 @@ def insert_nth(self, index: int, data: Any) -> None:
 raise IndexError("list index out of range.")
 new_node: Node = Node(data)
 if self.head is None:
 new_node.next = new_node # First node points to itself
 new_node.next_node = new_node # First node points to itself
 self.tail = self.head = new_node
 elif index == 0: # Insert at the head
 new_node.next = self.head
 new_node.next_node = self.head
 assert self.tail is not None # List is not empty, tail exists
 self.head = self.tail.next = new_node
 self.head = self.tail.next_node = new_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 new_node.next = temp.next
 temp.next = new_node
 new_node.next_node = temp.next_node
 temp.next_node = new_node
 if index == len(self) - 1: # Insert at the tail
 self.tail = new_node

Expand DownExpand Up@@ -130,18 +123,18 @@ def delete_nth(self, index: int = 0) -> Any:
 if self.head == self.tail: # Just one node
 self.head = self.tail = None
 elif index == 0: # Delete head node
 assert self.tail.next is not None
 self.tail.next = self.tail.next.next
 self.head = self.head.next
 assert self.tail.next_node is not None
 self.tail.next_node = self.tail.next_node.next_node
 self.head = self.head.next_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 assert temp.next is not None
 delete_node = temp.next
 temp.next = temp.next.next
 assert temp.next_node is not None
 delete_node = temp.next_node
 temp.next_node = temp.next_node.next_node
 if index == len(self) - 1: # Delete at tail
 self.tail = temp
 return delete_node.data
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Remove or un-stick sticky/fixed headers that block content
(function() {
function unstick() {
document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) {
if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {
el.style.position = 'static';
el.style.top = 'auto';
el.style.zIndex = 'auto';
}
});
}
unstick();
var observer = new MutationObserver(unstick);
observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });
})();
}
} catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); }
})();
})();
Use dataclasses in circular_linked_list.py by cclauss · Pull Request #10884 · TheAlgorithms/Python · GitHub
Skip to content
Use dataclasses in circular_linked_list.py#10884

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

tianyizheng02
merged 2 commits into

from

Oct 24, 2023
 Merged


Use dataclasses in circular_linked_list.py
#10884
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


2 commits


Select commit
Hold shift + click to select a range
65058a0

Use dataclasses in circular_linked_list.py


cclauss Oct 24, 2023
135a590

updating DIRECTORY.md

Oct 24, 2023

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


2 changes: 2 additions & 0 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -157,6 +157,7 @@
 * [Prefix Conversions](conversions/prefix_conversions.py)
 * [Prefix Conversions String](conversions/prefix_conversions_string.py)
 * [Pressure Conversions](conversions/pressure_conversions.py)
 * [Rgb Cmyk Conversion](conversions/rgb_cmyk_conversion.py)
 * [Rgb Hsv Conversion](conversions/rgb_hsv_conversion.py)
 * [Roman Numerals](conversions/roman_numerals.py)
 * [Speed Conversions](conversions/speed_conversions.py)
Expand DownExpand Up@@ -198,6 +199,7 @@
 * [Lowest Common Ancestor](data_structures/binary_tree/lowest_common_ancestor.py)
 * [Maximum Fenwick Tree](data_structures/binary_tree/maximum_fenwick_tree.py)
 * [Merge Two Binary Trees](data_structures/binary_tree/merge_two_binary_trees.py)
 * [Mirror Binary Tree](data_structures/binary_tree/mirror_binary_tree.py)
 * [Non Recursive Segment Tree](data_structures/binary_tree/non_recursive_segment_tree.py)
 * [Number Of Possible Binary Trees](data_structures/binary_tree/number_of_possible_binary_trees.py)
 * [Red Black Tree](data_structures/binary_tree/red_black_tree.py)
Expand Down

49 changes: 21 additions & 28 deletions
data_structures/linked_list/circular_linked_list.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,27 +1,20 @@
from __future__ import annotations

from collections.abc import Iterator
from dataclasses import dataclass
from typing import Any


@dataclass
class Node:
 def __init__(self, data: Any):
 """
 Initialize a new Node with the given data.
 Args:
 data: The data to be stored in the node.
 """
 self.data: Any = data
 self.next: Node | None = None # Reference to the next node
 data: Any
 next_node: Node | None = None


@dataclass
class CircularLinkedList:
 def __init__(self) -> None:
 """
 Initialize an empty Circular Linked List.
 """
 self.head: Node | None = None # Reference to the head (first node)
 self.tail: Node | None = None # Reference to the tail (last node)
 head: Node | None = None # Reference to the head (first node)
 tail: Node | None = None # Reference to the tail (last node)

 def __iter__(self) -> Iterator[Any]:
 """
Expand All@@ -32,7 +25,7 @@ def __iter__(self) -> Iterator[Any]:
 node = self.head
 while node:
 yield node.data
 node = node.next
 node = node.next_node
 if node == self.head:
 break

Expand DownExpand Up@@ -76,20 +69,20 @@ def insert_nth(self, index: int, data: Any) -> None:
 raise IndexError("list index out of range.")
 new_node: Node = Node(data)
 if self.head is None:
 new_node.next = new_node # First node points to itself
 new_node.next_node = new_node # First node points to itself
 self.tail = self.head = new_node
 elif index == 0: # Insert at the head
 new_node.next = self.head
 new_node.next_node = self.head
 assert self.tail is not None # List is not empty, tail exists
 self.head = self.tail.next = new_node
 self.head = self.tail.next_node = new_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 new_node.next = temp.next
 temp.next = new_node
 new_node.next_node = temp.next_node
 temp.next_node = new_node
 if index == len(self) - 1: # Insert at the tail
 self.tail = new_node

Expand DownExpand Up@@ -130,18 +123,18 @@ def delete_nth(self, index: int = 0) -> Any:
 if self.head == self.tail: # Just one node
 self.head = self.tail = None
 elif index == 0: # Delete head node
 assert self.tail.next is not None
 self.tail.next = self.tail.next.next
 self.head = self.head.next
 assert self.tail.next_node is not None
 self.tail.next_node = self.tail.next_node.next_node
 self.head = self.head.next_node
 else:
 temp: Node | None = self.head
 for _ in range(index - 1):
 assert temp is not None
 temp = temp.next
 temp = temp.next_node
 assert temp is not None
 assert temp.next is not None
 delete_node = temp.next
 temp.next = temp.next.next
 assert temp.next_node is not None
 delete_node = temp.next_node
 temp.next_node = temp.next_node.next_node
 if index == len(self) - 1: # Delete at tail
 self.tail = temp
 return delete_node.data
Expand Down