Day3: Linked List

Single LInked List in Python

class ListNode(Object):
	def __init__(self, val, next=None):
		#object linked list has 2 properties: its own value and its link to next Node!
		self.val = val
		self.next = next

Leetcode 203. Remove Linked List Elements

Single Linked List: We know the property of linked list above;
Task: to remove the node with a certain value.
Method: Create dummy node
Trick: new object represents dummy node and operate on new object
Code:

class Solution:
    def removeElements(self, head: Optional[ListNode], val: int) -> Optional[ListNode]:
        dummy=ListNode(-1, head)
        now = dummy
        while now.next:
            if now.next.val==val:
                now.next = now.next.next
            else:
                now = now.next
        return now.next

Leetcode 707. Remove Linked List Elements

Objective: Create using OOP mind! Unit test!

Requirment:

New Class MyLinkedList has property of head and size!
get(index) > return node[index].val
addAtHead(newval) > newval.next = linked list
addAtTail(newval) > linked List.next = newval > newnode.next = None
addAtIndex(ind, val) > node_prev + node[ind] = val + node_after = Linked LIst

Code:

class Node(object):
    def __init__(self, x=0):
        self.val = x
        self.next = None
class MyLinkedList(object):

    def __init__(self):
        self.head = Node()
        self.size = 0 # 设置一个链表长度的属性，便于后续操作，注意每次增和删的时候都要更新

    def get(self, index):
        """
        :type index: int
        :rtype: int
        """
        if index < 0 or index >= self.size:
            return -1
        cur = self.head.next
        while(index):
            cur = cur.next
            index -= 1
        return cur.val

    def addAtHead(self, val):
        """
        :type val: int
        :rtype: None
        """
        new_node = Node(val)
        new_node.next = self.head.next
        self.head.next = new_node
        self.size += 1

    def addAtTail(self, val):
        """
        :type val: int
        :rtype: None
        """
        new_node = Node(val)
        cur = self.head
        while(cur.next):
            cur = cur.next
        cur.next = new_node
        self.size += 1

    def addAtIndex(self, index, val):
        """
        :type index: int
        :type val: int
        :rtype: None
        """
        if index < 0:
            self.addAtHead(val)
            return
        elif index == self.size:
            self.addAtTail(val)
            return
        elif index > self.size:
            return

        node = Node(val)
        pre = self.head
        while(index):
            pre = pre.next
            index -= 1
        node.next = pre.next
        pre.next = node
        self.size += 1
        
    def deleteAtIndex(self, index):
        """
        :type index: int
        :rtype: None
        """
        if index < 0 or index >= self.size:
            return
        pre = self.head
        while(index):
            pre = pre.next
            index -= 1
        pre.next = pre.next.next
        self.size -= 1

Leetcode 707. Remove Linked List Elements

Objective : Reverse whole singly linked list!

Method: Two pointers! step by step update!

Code:

    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        prev= None
        cur = head
        while cur:
            tmp = cur.next
            cur.next=prev
            prev = cur
            cur = tmp
        return prev