代码随想录Day3|链表，203.移除链表元素 ，707.设计链表 ， 206.反转链表

203

# Definition for singly-linked list.

# class ListNode(object):

#     def __init__(self, val=0, next=None):

#         self.val = val

#         self.next = next

class Solution(object):

    def removeElements(self, head, val):

        """

        :type head: ListNode

        :type val: int

        :rtype: ListNode

        """

        dummy_head = ListNode(next = head)

        cur = dummy_head

        while cur.next:

            if cur.next.val == val:

                cur.next = cur.next.next

            else:

                cur = cur.next

        return dummy_head.next

707.

class MyLinkedList(object):

    def __init__(self):

        self.dummy_head = ListNode()

        self.size = 0

 

    def get(self, index):

        """

        :type index: int

        :rtype: int

        """

        if index >= self.size or index < 0:

            return -1

        else:

            cur = self.dummy_head

            for i in range(index):

                cur = cur.next

            return cur.next.val

 

    def addAtHead(self, val):

        """

        :type val: int

        :rtype: None

        """

        t = self.dummy_head.next

        node = ListNode(val)

        self.dummy_head.next = node

        self.dummy_head.next.next = t

        self.size +=1

    def addAtTail(self, val):

        """

        :type val: int

        :rtype: None

        """

        cur = self.dummy_head

        while cur.next:

            cur = cur.next

        cur.next = ListNode(val)

        self.size +=1

       

    def addAtIndex(self, index, val):

        """

        :type index: int

        :type val: int

        :rtype: None

        """

        if index < 0 or index > self.size:

            return -1

        node = ListNode(val)

        cur = self.dummy_head

        for i in range(index):

            cur = cur.next

        node.next = cur.next

        cur.next = node

        self.size +=1

       

    def deleteAtIndex(self, index):

        """

        :type index: int

        :rtype: None

        """

        if index <0 or index >= self.size:

            return -1

        cur = self.dummy_head

        for i in range(index):

            cur = cur.next

        cur.next = cur.next.next

        self.size -=1

 

# Your MyLinkedList object will be instantiated and called as such:

# obj = MyLinkedList()

# param_1 = obj.get(index)

# obj.addAtHead(val)

# obj.addAtTail(val)

# obj.addAtIndex(index,val)

# obj.deleteAtIndex(index)

206

# Definition for singly-linked list. # class ListNode(object): # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution(object): def reverseList(self, head): """ :type head: ListNode :rtype: ListNode """ cur =head pre = None while (cur): tmp = cur.next cur.next = pre pre = cur cur = tmp return pre 先处理cur，再处理cur.next