牛客网剑指Offer-JZ16.合并两个排序的链表

# =============================JZ16.合并两个排序的链表================================================
# 题目要求：给两个非递减单链表l1, l2，合并为一个非递减的单链表。
# =============================================================================


#链表学习1
 
class Node(object): #定义一个节点
    def __init__(self,elem):
        self.elem = elem
        self.next = None
class SingleLinkList(object):
    def __init__(self,node = None):
        self.__head = node  #特别需要注意的是，这个class中的self.__head指的是一个节点，也就是说凡是定义为self.__head的都是一个节点
    def is_empty(self):
        return self.__head == None
    def travel(self): #遍历函数
        #设置一个游标cur
        cur = self.__head  #cur现在指的位置是首地址指的位置
        while cur != None:
            print(cur.elem, end = " ")  #空格是禁止换行  利用空格代替\n
            cur = cur.next #游标向后移动
    def length(self):
        cur = self.__head  #cur现在指的位置是首地址指的位置
        #count 记录数量
        count = 0
        while cur != None:
            count += 1 
            cur = cur.next
        return count
    def addend(self,item):
        node = Node(item)
        if self.is_empty():
            self.__head = node
        else:
            cur = self.__head
            while cur.next != None:
                cur = cur.next
            cur.next = node
    def addhead(self,item):
        node = Node(item)
        node.next = self.__head
        self.__head = node
    def insert(self,pos,item):
        if pos < 0:
            return self.addhead(item)
        elif pos > (self.length() - 1):
            return self.addend(item)
        else:
            pre = self.__head   #设置一个表示之前位置的游标pre
            count = 0
            while count < (pos -1):
                count += 1
                pre = pre.next 
            #当循环退出后，pre指向pos-1的位置
            node = Node(item)
            node.next = pre.next
            pre.next = node
    def search(self,item):
        cur = self.__head  #一定要记住，遇到计数的时候要用到游标，游标指向第一个节点
        while cur != None :
            if cur.elem == item:
                return True
            else:
                cur = cur.next
        return False
        
    def remove(self,item):
        cur = self.__head
        pre = None 
        while cur != None:
            if cur.elem == item:
                if cur == self.__head: #先判断要删除的节点是不是头结点
                    self.__head = cur.next
                else:
                    pre.next = cur.next
                break
            else:
                pre = cur
                cur = cur.next
        
        
        




            
ll = SingleLinkList()

print(ll.is_empty())
print(ll.length())
ll.addend(1)
print(ll.is_empty())
print(ll.length())

ll.addend(2)
ll.addend(3)   
ll.addend(4)
ll.addend(5)
ll.addend(6) 
ll.addhead(10)
ll.insert(2,100)
print(ll.length()) 
ll.travel()  
ll.search(100)
print()  #分段
ll.remove(100)
ll.travel()

#习题解答
#答题思路：设置三个游标和一个头节点

class Solution:
    # 返回合并后列表
    def Merge(self, ph1, ph2):
        # write code here
        if ph1 == None:
            return ph2
        if ph2 == None:
            return ph1
        if ph1.val < ph2.val:
            newhead = ph1
        else:
            newhead = ph2
        tmp1 = ph1  #游标1
        tmp2 = ph2  #游标2
        
        if newhead == tmp1:
            pre = newhead
            tmp1 = tmp1.next  
        if newhead == tmp2:
            pre = newhead
            tmp2 = tmp2.next  
        while tmp1 and tmp2:
            if tmp1.val<tmp2.val:
                pre.next = tmp1
                pre = tmp1
                tmp1 = tmp1.next
            else:
                pre.next = tmp2
                pre = tmp2
                tmp2 = tmp2.next
                
        if tmp1 == None:
            pre.next = tmp2
        else:
            pre.next = tmp1
        return newhead   #返回值需要是头节点