代码随想录 Day3

203.移除链表元素

建立虚拟头部节点，方便删除元素

class Solution(object):
    def removeElements(self, head, val):
        d_head=ListNode(next=head)
        current=d_head
        while current.next:
            if current.next.val==val:
                current.next=current.next.next
            else:
                current=current.next
        return d_head.next

707.设计链表

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next
        
class MyLinkedList:
    def __init__(self):
        self.dummy_head = ListNode()
        self.size = 0

    def get(self, index):
        if index < 0 or index >= self.size:
            return -1
        
        current = self.dummy_head.next
        for i in range(index):
            current = current.next
            
        return current.val

    def addAtHead(self, val):
        self.dummy_head.next = ListNode(val, self.dummy_head.next)
        self.size += 1

    def addAtTail(self, val):
        current = self.dummy_head
        while current.next:
            current = current.next
        current.next = ListNode(val)
        self.size += 1

    def addAtIndex(self, index, val):
        if index < 0 or index > self.size:
            return
        
        current = self.dummy_head
        for i in range(index):
            current = current.next
        current.next = ListNode(val, current.next)
        self.size += 1

    def deleteAtIndex(self, index) :
        if index < 0 or index >= self.size:
            return
        
        current = self.dummy_head
        for i in range(index):
            current = current.next
        current.next = current.next.next
        self.size -= 1

206.反转链表

（1）双指针法

class Solution(object):
    def reverseList(self, head):
        cur=head
        pre=None
        while cur:
            temp=cur.next
            cur.next=pre
            pre=cur
            cur=temp
        return pre
       

2.递归法

class Solution(object):
    def reverseList(self, head):
      return self.reverse(head,None)
    def reverse(self,cur,pre):
        if cur==None:
            return pre
        temp=cur.next
        cur.next=pre
        return self.reverse(temp,cur)