88. 合併兩個有序陣列（第88題）

class Solution:
    def merge(self, nums1, m, nums2, n):
        """
        :type nums1: List[int]
        :type m: int
        :type nums2: List[int]
        :type n: int
        :rtype: void Do not return anything, modify nums1 in-place instead.
        """
        
        for i in range(m,m+n):
            nums1[i] = nums2[i-m]
        nums1.sort()
 

89. 合併相同的樹（第100題）

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def isSameTree(self, p, q):
        """
        :type p: TreeNode
        :type q: TreeNode
        :rtype: bool
        """
        
        if p == None and q == None:
            return True
        if p == None or q == None:
            return False
        if p.val == q.val:
            return (self.isSameTree(p.left,q.left) and self.isSameTree(p.right,q.right))
        else:
            return False