Commit dfdd781

tianyizheng02github-actions

and

github-actions

authored

Fix mypy errors in circular_linked_list.py and swap_nodes.py (TheAlgorithms#9707)

* updating DIRECTORY.md * Fix mypy errors in circular_linked_list.py * Fix mypy errors in swap_nodes.py --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>

1 parent 3fd3497 commit dfdd781Copy full SHA for dfdd781

File tree

3 files changed

+19

-12

lines changed

DIRECTORY.md
data_structures/linked_list
- circular_linked_list.py
- swap_nodes.py

3 files changed

+19

-12

lines changed

`‎DIRECTORY.md‎`

Lines changed: 2 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -541,8 +541,8 @@`
`541`	`541`	`* [Basic Maths](maths/basic_maths.py)`
`542`	`542`	`* [Binary Exp Mod](maths/binary_exp_mod.py)`
`543`	`543`	`* [Binary Exponentiation](maths/binary_exponentiation.py)`
`544`		`- * [Binary Exponentiation 2](maths/binary_exponentiation_2.py)`
`545`	`544`	`* [Binary Exponentiation 3](maths/binary_exponentiation_3.py)`
	`545`	`+ * [Binary Multiplication](maths/binary_multiplication.py)`
`546`	`546`	`* [Binomial Coefficient](maths/binomial_coefficient.py)`
`547`	`547`	`* [Binomial Distribution](maths/binomial_distribution.py)`
`548`	`548`	`* [Bisection](maths/bisection.py)`
`@@ -557,8 +557,7 @@`
`557`	`557`	`* [Decimal Isolate](maths/decimal_isolate.py)`
`558`	`558`	`* [Decimal To Fraction](maths/decimal_to_fraction.py)`
`559`	`559`	`* [Dodecahedron](maths/dodecahedron.py)`
`560`		`- * [Double Factorial Iterative](maths/double_factorial_iterative.py)`
`561`		`- * [Double Factorial Recursive](maths/double_factorial_recursive.py)`
	`560`	`+ * [Double Factorial](maths/double_factorial.py)`
`562`	`561`	`* [Dual Number Automatic Differentiation](maths/dual_number_automatic_differentiation.py)`
`563`	`562`	`* [Entropy](maths/entropy.py)`
`564`	`563`	`* [Euclidean Distance](maths/euclidean_distance.py)`

`‎data_structures/linked_list/circular_linked_list.py‎`

Lines changed: 15 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -20,8 +20,8 @@ def __init__(self) -> None:`
`20`	`20`	`"""`
`21`	`21`	`Initialize an empty Circular Linked List.`
`22`	`22`	`"""`
`23`		`- self.head = None # Reference to the head (first node)`
`24`		`- self.tail = None # Reference to the tail (last node)`
	`23`	`+ self.head: Node\|None = None # Reference to the head (first node)`
	`24`	`+ self.tail: Node\|None = None # Reference to the tail (last node)`
`25`	`25`
`26`	`26`	`def __iter__(self) -> Iterator[Any]:`
`27`	`27`	`"""`
`@@ -30,7 +30,7 @@ def __iter__(self) -> Iterator[Any]:`
`30`	`30`	`The data of each node in the linked list.`
`31`	`31`	`"""`
`32`	`32`	`node = self.head`
`33`		`- while self.head:`
	`33`	`+ while node:`
`34`	`34`	`yield node.data`
`35`	`35`	`node = node.next`
`36`	`36`	`if node == self.head:`
`@@ -74,17 +74,20 @@ def insert_nth(self, index: int, data: Any) -> None:`
`74`	`74`	`"""`
`75`	`75`	`if index < 0 or index > len(self):`
`76`	`76`	`raise IndexError("list index out of range.")`
`77`		`- new_node = Node(data)`
	`77`	`+ new_node: Node = Node(data)`
`78`	`78`	`if self.head is None:`
`79`	`79`	`new_node.next = new_node # First node points to itself`
`80`	`80`	`self.tail = self.head = new_node`
`81`	`81`	`elif index == 0: # Insert at the head`
`82`	`82`	`new_node.next = self.head`
	`83`	`+ assert self.tail is not None # List is not empty, tail exists`
`83`	`84`	`self.head = self.tail.next = new_node`
`84`	`85`	`else:`
`85`		`- temp = self.head`
	`86`	`+ temp: Node\|None = self.head`
`86`	`87`	`for _ in range(index - 1):`
	`88`	`+ assert temp is not None`
`87`	`89`	`temp = temp.next`
	`90`	`+ assert temp is not None`
`88`	`91`	`new_node.next = temp.next`
`89`	`92`	`temp.next = new_node`
`90`	`93`	`if index == len(self) - 1: # Insert at the tail`
`@@ -120,16 +123,21 @@ def delete_nth(self, index: int = 0) -> Any:`
`120`	`123`	`"""`
`121`	`124`	`if not 0 <= index < len(self):`
`122`	`125`	`raise IndexError("list index out of range.")`
`123`		`- delete_node = self.head`
	`126`	`+`
	`127`	`+ assert self.head is not None and self.tail is not None`
	`128`	`+ delete_node: Node = self.head`
`124`	`129`	`if self.head == self.tail: # Just one node`
`125`	`130`	`self.head = self.tail = None`
`126`	`131`	`elif index == 0: # Delete head node`
	`132`	`+ assert self.tail.next is not None`
`127`	`133`	`self.tail.next = self.tail.next.next`
`128`	`134`	`self.head = self.head.next`
`129`	`135`	`else:`
`130`		`- temp = self.head`
	`136`	`+ temp: Node\|None = self.head`
`131`	`137`	`for _ in range(index - 1):`
	`138`	`+ assert temp is not None`
`132`	`139`	`temp = temp.next`
	`140`	`+ assert temp is not None and temp.next is not None`
`133`	`141`	`delete_node = temp.next`
`134`	`142`	`temp.next = temp.next.next`
`135`	`143`	`if index == len(self) - 1: # Delete at tail`

`‎data_structures/linked_list/swap_nodes.py‎`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,15 +11,15 @@ def __init__(self, data: Any) -> None:`
`11`	`11`
`12`	`12`	`"""`
`13`	`13`	`self.data = data`
`14`		`- self.next = None # Reference to the next node`
	`14`	`+ self.next: Node\|None = None # Reference to the next node`
`15`	`15`
`16`	`16`
`17`	`17`	`class LinkedList:`
`18`	`18`	`def __init__(self) -> None:`
`19`	`19`	`"""`
`20`	`20`	`Initialize an empty Linked List.`
`21`	`21`	`"""`
`22`		`- self.head = None # Reference to the head (first node)`
	`22`	`+ self.head: Node\|None = None # Reference to the head (first node)`
`23`	`23`
`24`	`24`	`def print_list(self):`
`25`	`25`	`"""`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit dfdd781

File tree

3 files changed

3 files changed

`‎DIRECTORY.md‎`

`‎data_structures/linked_list/circular_linked_list.py‎`

`‎data_structures/linked_list/swap_nodes.py‎`

0 commit comments