Vwwxrf

Opacity of an object in 2.8

How could a scammer know the apps on my phone / iTunes account?

Why doesn't the EU now just force the UK to choose between referendum and no-deal?

Why would a flight no longer considered airworthy be redirected like this?

How do I hide Chekhov's Gun?

Why Choose Less Effective Armour Types?

How can I track script which gives me "command not found" right after the login?

Recruiter wants very extensive technical details about all of my previous work

How to write cleanly even if my character uses expletive language?

Should we release the security issues we found in our product as CVE or we can just update those on weekly release notes?

Are all passive ability checks floors for active ability checks?

What is the significance behind "40 days" that often appears in the Bible?

Is there a data structure that only stores hash codes and not the actual objects?

Why does Bach not break the rules here?

Identifying the interval from A♭ to D♯

How to terminate ping <dest> &

How Could an Airship Be Repaired Mid-Flight

Is it true that good novels will automatically sell themselves on Amazon (and so on) and there is no need for one to waste time promoting?

Most cost effective thermostat setting: consistent temperature vs. lowest temperature possible

My adviser wants to be the first author

How to simplify this time periods definition interface?

How to explain that I do not want to visit a country due to personal safety concern?

Can a druid choose the size of its wild shape beast?

What did Alexander Pope mean by "Expletives their feeble Aid do join"?

Implement LinkedList class in python

Critique of LinkedList classOptimising LinkedList class - Part 2LinkedList (doubly) implementationPython class to implement a list with a size limitLinkedList implementation in PythonPython 2 Stack and LinkedList implementationLinkedList class implementation in PythonLeetcode #146. LRUCache solution in Java (Doubly Linked List + HashMap)Simple LinkedListA LinkedList implementation in Python

0

$begingroup$

I am currently study the basic data structure and trying to implement everything as I go. can anyone give me some feedback about class LinkedList how to make the code more elegant. any review are appreciated.

class Node(object):
 def __init__(self, data, n=None):
 self.val = data
 self.next = n

 def get(self):
 return self.data

 def set(self, data):
 self.val = data

 def get_next_node(self):
 return self.next

 def set_next_node(self, data):
 self.next.val = data


class SingleLinkedList(object):
 """
 Single Linked List object
 Args:
 data(Node): Node
 Attributes:
 head(Node): single LinkedList head
 """

 def __init__(self, data):
 self.head = data

 def __repr__(self):
 """
 :return:
 """
 cur = self.head
 s = ''
 while cur:
 s += f'cur.val->'
 cur = cur.next
 return s

 def __len__(self):
 cur, cnt = self.head, 0
 while cur:
 cnt += 1
 cur = cur.next
 return cnt

 def append(self, data):
 if not self.head:
 self.head = Node(data)
 return
 cur = self.head
 while cur.next: cur = cur.next
 cur.next = Node(data)

 def insert_before_key(self, key, data):
 cur = self.head
 prev = Node(None)
 while cur:
 if cur.val == key:
 node = Node(data)
 node.next = cur
 prev.next = node
 break
 prev = cur
 cur = cur.next
 self.head = prev.next

 def insert_after_key(self, key, data):
 cur = self.head
 while cur:
 if cur.val == key:
 node = Node(data)
 node.next = cur.next
 cur.next = node
 cur = cur.next

 def delete(self, key):
 if not self.head: return
 dummy = cur = self.head
 prev = None
 while cur:
 if cur.val == key and prev:
 prev.next = cur.next
 self.head = dummy
 return
 elif cur.val == key:
 self.head = cur.next
 return
 prev = cur
 cur = cur.next

 def search(self, key):
 cur = self.head
 while cur and cur.val != key:
 cur = cur.next
 return cur or None

 def reverse(self):
 cur = self.head
 prev = None
 while cur:
 nxt = cur.next
 cur.next = prev
 prev = cur
 cur = nxt
 self.head = prev
```

python-3.x linked-list

share

asked 7 mins ago

A.LeeA.Lee

493

$endgroup$

add a comment | 

0

$begingroup$

I am currently study the basic data structure and trying to implement everything as I go. can anyone give me some feedback about class LinkedList how to make the code more elegant. any review are appreciated.

class Node(object):
 def __init__(self, data, n=None):
 self.val = data
 self.next = n

 def get(self):
 return self.data

 def set(self, data):
 self.val = data

 def get_next_node(self):
 return self.next

 def set_next_node(self, data):
 self.next.val = data


class SingleLinkedList(object):
 """
 Single Linked List object
 Args:
 data(Node): Node
 Attributes:
 head(Node): single LinkedList head
 """

 def __init__(self, data):
 self.head = data

 def __repr__(self):
 """
 :return:
 """
 cur = self.head
 s = ''
 while cur:
 s += f'cur.val->'
 cur = cur.next
 return s

 def __len__(self):
 cur, cnt = self.head, 0
 while cur:
 cnt += 1
 cur = cur.next
 return cnt

 def append(self, data):
 if not self.head:
 self.head = Node(data)
 return
 cur = self.head
 while cur.next: cur = cur.next
 cur.next = Node(data)

 def insert_before_key(self, key, data):
 cur = self.head
 prev = Node(None)
 while cur:
 if cur.val == key:
 node = Node(data)
 node.next = cur
 prev.next = node
 break
 prev = cur
 cur = cur.next
 self.head = prev.next

 def insert_after_key(self, key, data):
 cur = self.head
 while cur:
 if cur.val == key:
 node = Node(data)
 node.next = cur.next
 cur.next = node
 cur = cur.next

 def delete(self, key):
 if not self.head: return
 dummy = cur = self.head
 prev = None
 while cur:
 if cur.val == key and prev:
 prev.next = cur.next
 self.head = dummy
 return
 elif cur.val == key:
 self.head = cur.next
 return
 prev = cur
 cur = cur.next

 def search(self, key):
 cur = self.head
 while cur and cur.val != key:
 cur = cur.next
 return cur or None

 def reverse(self):
 cur = self.head
 prev = None
 while cur:
 nxt = cur.next
 cur.next = prev
 prev = cur
 cur = nxt
 self.head = prev
```

python-3.x linked-list

share

asked 7 mins ago

A.LeeA.Lee

493

$endgroup$

add a comment | 

$begingroup$

I am currently study the basic data structure and trying to implement everything as I go. can anyone give me some feedback about class LinkedList how to make the code more elegant. any review are appreciated.

class Node(object):
 def __init__(self, data, n=None):
 self.val = data
 self.next = n

 def get(self):
 return self.data

 def set(self, data):
 self.val = data

 def get_next_node(self):
 return self.next

 def set_next_node(self, data):
 self.next.val = data


class SingleLinkedList(object):
 """
 Single Linked List object
 Args:
 data(Node): Node
 Attributes:
 head(Node): single LinkedList head
 """

 def __init__(self, data):
 self.head = data

 def __repr__(self):
 """
 :return:
 """
 cur = self.head
 s = ''
 while cur:
 s += f'cur.val->'
 cur = cur.next
 return s

 def __len__(self):
 cur, cnt = self.head, 0
 while cur:
 cnt += 1
 cur = cur.next
 return cnt

 def append(self, data):
 if not self.head:
 self.head = Node(data)
 return
 cur = self.head
 while cur.next: cur = cur.next
 cur.next = Node(data)

 def insert_before_key(self, key, data):
 cur = self.head
 prev = Node(None)
 while cur:
 if cur.val == key:
 node = Node(data)
 node.next = cur
 prev.next = node
 break
 prev = cur
 cur = cur.next
 self.head = prev.next

 def insert_after_key(self, key, data):
 cur = self.head
 while cur:
 if cur.val == key:
 node = Node(data)
 node.next = cur.next
 cur.next = node
 cur = cur.next

 def delete(self, key):
 if not self.head: return
 dummy = cur = self.head
 prev = None
 while cur:
 if cur.val == key and prev:
 prev.next = cur.next
 self.head = dummy
 return
 elif cur.val == key:
 self.head = cur.next
 return
 prev = cur
 cur = cur.next

 def search(self, key):
 cur = self.head
 while cur and cur.val != key:
 cur = cur.next
 return cur or None

 def reverse(self):
 cur = self.head
 prev = None
 while cur:
 nxt = cur.next
 cur.next = prev
 prev = cur
 cur = nxt
 self.head = prev
```

python-3.x linked-list

share

asked 7 mins ago

A.LeeA.Lee

493

$endgroup$

class Node(object):
 def __init__(self, data, n=None):
 self.val = data
 self.next = n

 def get(self):
 return self.data

 def set(self, data):
 self.val = data

 def get_next_node(self):
 return self.next

 def set_next_node(self, data):
 self.next.val = data


class SingleLinkedList(object):
 """
 Single Linked List object
 Args:
 data(Node): Node
 Attributes:
 head(Node): single LinkedList head
 """

 def __init__(self, data):
 self.head = data

 def __repr__(self):
 """
 :return:
 """
 cur = self.head
 s = ''
 while cur:
 s += f'cur.val->'
 cur = cur.next
 return s

 def __len__(self):
 cur, cnt = self.head, 0
 while cur:
 cnt += 1
 cur = cur.next
 return cnt

 def append(self, data):
 if not self.head:
 self.head = Node(data)
 return
 cur = self.head
 while cur.next: cur = cur.next
 cur.next = Node(data)

 def insert_before_key(self, key, data):
 cur = self.head
 prev = Node(None)
 while cur:
 if cur.val == key:
 node = Node(data)
 node.next = cur
 prev.next = node
 break
 prev = cur
 cur = cur.next
 self.head = prev.next

 def insert_after_key(self, key, data):
 cur = self.head
 while cur:
 if cur.val == key:
 node = Node(data)
 node.next = cur.next
 cur.next = node
 cur = cur.next

 def delete(self, key):
 if not self.head: return
 dummy = cur = self.head
 prev = None
 while cur:
 if cur.val == key and prev:
 prev.next = cur.next
 self.head = dummy
 return
 elif cur.val == key:
 self.head = cur.next
 return
 prev = cur
 cur = cur.next

 def search(self, key):
 cur = self.head
 while cur and cur.val != key:
 cur = cur.next
 return cur or None

 def reverse(self):
 cur = self.head
 prev = None
 while cur:
 nxt = cur.next
 cur.next = prev
 prev = cur
 cur = nxt
 self.head = prev
```

share

asked 7 mins ago

A.LeeA.Lee

493

share

asked 7 mins ago

A.LeeA.Lee

493

asked 7 mins ago

A.LeeA.Lee

493

asked 7 mins ago

A.LeeA.Lee

493