Commit ec908ad

authored

Update Swap_Nodes_in_Pairs.py

1 parent 8dfbf1f commit ec908adCopy full SHA for ec908ad

File tree

+13

-2

lines changed

+13

-2

lines changed

Lines changed: 13 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-# Solution - 1: Swapping the Nodes \| Time: O(N) and Space: O(1)`
	`1`	`+# Solution - 1: Swapping the Nodes (Iterative) \| Time: O(N) and Space: O(1)`
`2`	`2`	`class Solution:`
`3`	`3`	`def swapPairs(self, head: Optional[ListNode]) -> Optional[ListNode]:`
`4`	`4`	`# Base condition`
`@@ -22,8 +22,19 @@ def swapPairs(self, head: Optional[ListNode]) -> Optional[ListNode]:`
`22`	`22`
`23`	`23`	`return t_head`
`24`	`24`
	`25`	`+# Solution - 1 Swapping the Nodes (Recursive) \| Time: O(N) and Space: O(N)`
	`26`	`+class Solution:`
	`27`	`+ def swapPairs(self, head: Optional[ListNode]) -> Optional[ListNode]:`
	`28`	`+ if head and head.next:`
	`29`	`+ temp = head.next`
	`30`	`+ head.next = self.swapPairs(temp.next)`
	`31`	`+ temp.next = head`
	`32`	`+ return temp`
	`33`	`+`
	`34`	`+ return head`
`25`	`35`
`26`		`-# Solution - 2: Swapping the Values \| Time: O(N) and Space: O(1)`
	`36`	`+`
	`37`	`+ # Solution - 2: Swapping the Values \| Time: O(N) and Space: O(1)`
`27`	`38`	`class Solution:`
`28`	`39`	`def swapPairs(self, head: ListNode) -> ListNode:`
`29`	`40`	`if not head or not head.next:`

Comments

(0)