python

checkMap = [[0 for y in range(nYCount)] for x in range(nXCount)]
nLength = len(checkMap)

#2.set() : 獨立不重覆    {}
#3.dict() : 字典         {{}}
#4.tuple() : 不可改變   ()

  listVar = list([5,3,3])
  setVar = set([5,3,3])
    
 print(listVar)
   print(setVar)
    
 #[5, 3, 3]
  #{3, 5}

class :
   def judgeCircle(self, moves):
       return moves.count('L') == moves.count('R') and moves.count('U') == moves.count('D') 
       """
       :type moves: str
       :rtype: bool
       """

return (A.index(max(A)))

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

class (object):
    def mergeTrees(self, t1, t2):
        NewNode = TreeNode(0)
        def nextLoop(tCurrent,tcopy):
            if tcopy == None:
                return
            tCurrent.val += tcopy.val
            print(tcopy.val)
            if tcopy.left is not None:
                if tCurrent.left == None:
                    tCurrent.left = TreeNode(0)
                nextLoop(tCurrent.left,tcopy.left)
            if tcopy.right is not None:
                if tCurrent.right == None:
                    tCurrent.right = TreeNode(0)
                nextLoop(tCurrent.right,tcopy.right)
        nextLoop(NewNode,t1)
        nextLoop(NewNode,t2)
        if t1 == None and t2 == None:
            NewNode = None
        return NewNode
        """
        :type t1: TreeNode
        :type t2: TreeNode
        :rtype: TreeNode
        """