2022-09-24 leetcode 1640 题目，早早re

这是leetcode 1640 题目，早早return 法

class Solution:
    def canFormArray(self, arr, pieces) :
        d={}
        for i,v in enumerate(pieces):
            d[v[0]]=i

        g=0;l=len(arr)
        while g<l:
            n=arr[g]
            if n not in d:
                return False
            m=pieces[d[n]]
            k=len(m)
            if m  !=  arr[g:g+k]:
                return False
            g+=k
        return True
cc=Solution()
a=[15,16,17,18]
pp = [[17,18],[15,16,88]]
cc.canFormArray(a,pp)