狗家算法面试高频题汇总

class Solution:
    def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
        if not flowerbed: return not n
        
        cnt = 0
        for i in range(len(flowerbed)): 
            if flowerbed[i] == 0 and (i == 0 or flowerbed[i-1] == 0) 
                and (i == len(flowerbed)-1  or flowerbed[i+1] == 0):
                
                flowerbed[i] = 1
                cnt += 1
                
        return cnt >= n

class Solution:
    def findContentChildren(self, g: List[int], s: List[int]) -> int:
        g.sort()
        s.sort()
        
        i, j, cnt = 0, 0, 0
        while i < len(g) and j < len(s):
            if g[i] <= s[j]:
                i+=1
                j+=1
                cnt+=1
            else:
                j+=1
                    
        return cnt        

class Solution:
    def repeatedSubstringPattern(self, s: str) -> bool:
        for i in range(len(s)//2):
            if len(s) % (i+1) == 0 and s[:i+1] * (len(s)//(i+1)) == s:
                return True
        return False