leetcode-5.8[367. 有效的完全平方数、290. 单词规律、914. 卡牌分组]（python实现)

题目1

题解1

class Solution:
    def isPerfectSquare(self, num: int) -> bool:
        """
            二分查找
        """
        if num < 2:
            return num
        # 因为除了1以外的所有有效数的完全平方一定小于等于num//2
        left, right = 2, num//2
        while left <= right:
            mid = (left+right)//2
            guess_squared = mid*mid
            if num < guess_squared:
                right = mid - 1
            elif num > guess_squared:
                left = mid + 1
            else:
                return True
        return False

附上题目链接

题目2

题目2

class Solution:
    def wordPattern(self, pattern: str, str: str) -> bool:
        str = str.split()
        if len(str) != len(pattern):
            return False
        for i in range(len(pattern)):
            for j in range(i,len(pattern)):
                if pattern[i] == pattern[j]:
                    if str[i] != str[j]:
                        return False
                else:
                    if str[i] == str[j]:
                        return False
        return True

附上题目链接

题目3

题解3

class Solution:
    def hasGroupsSizeX(self, deck: List[int]) -> bool:
        """
            最大公约数
        """
        from collections import Counter
        from functools import reduce
        from fractions import gcd
        count = Counter(deck).values()
        return reduce(gcd, count) >= 2

附上题目链接