【leecode刷题】初级算法-链表

1、删除链表中的节点

class Solution(object):
    def deleteNode(self, node):
        """
        :type node: ListNode
        :rtype: void Do not return anything, modify node in-place instead.
        """
        node.val = node.next.val
        node.next = node.next.next

2、删除链表的倒数第N个节点

class Solution(object):
    def removeNthFromEnd(self, head, n):
        """
        :type head: ListNode
        :type n: int
        :rtype: ListNode
        """
        # 计算链表中元素的个数，保存于变量node_no中
        node_no = 0
        node = head
        while node is not None:
            node = node.next
            node_no += 1
            
        # 被删除节点的索引值
        node_no -= n + 1

        node = head
        if node_no == -1:
            head = head.next
        else:
            while(node_no):
                node = node.next
                node_no -= 1
            node.next = node.next.next
        return head

3、反转链表

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

4、合并两个有序链表

class Solution(object):
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        if l1 is None:
            return l2
        elif l2 is None:
            return l1
        elif l1.val < l2.val:
            l1.next = self.mergeTwoLists(l1.next, l2)
            return l1
        else:
            l2.next = self.mergeTwoLists(l1, l2.next)
            return l2

5、回文链表

class Solution(object):
    def isPalindrome(self, head):
        """
        :type head: ListNode
        :rtype: bool
        """
        if not (head and head.next):
            return True
        arr = []
        i = 0
		# 申请一个数组，然后把元素都放到数组中
        while head:
            arr.append(head.val)
            head = head.next
        j = len(arr)-1
		# 用i和j两个指针，一个往后，一个往前，不断迭代
		# 如果i的值不等于j说明不是回文，反之是回文
        while i<j:
            if arr[i]!=arr[j]:
                return False
            i,j = i+1,j-1
        return True

6、环形链表

class Solution(object):
    def hasCycle(self, head):
        """
        :type head: ListNode
        :rtype: bool
        """
        if not head or not head.next:
            return False
        slow=head
        fast=head.next
        while slow!=fast:
            if fast is None or fast.next is None:
                return False
            slow=slow.next
            fast=fast.next.next
        return True