Day33

class Solution(object):
    def findMaxConsecutiveOnes(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        s = map(str,nums)
        s1= ''.join(s)
        tmp = 0
        for i in s1.split('0'):      
            tmp = max(tmp,len(i))
        return tmp

class Solution(object):
    def invertTree(self, root):
        """
        :type root: TreeNode
        :rtype: TreeNode
        """
        if root:
            root.left, root.right = self.invertTree(root.right), self.invertTree(root.left)
        return root