[Leetcode] 每日两题 2013 2047 -day83

2013. 检测正方形

使用仨哈希记录，首先记录x下 不同的y 的list

在记录y 下 不同的x 的list

再统计x,y点的个数 因为题目允许重复点

对于 新来的点 a,b

查找在 a下有多少个的y，对于每个y 计算其边长，然后去找相应的x点位，再乘与要找的两个点的数量，累计和

class DetectSquares:

    def __init__(self):
        self.dicx = defaultdict(list)
        self.dicy = defaultdict(list)
        self.dic = defaultdict(int)

    def add(self, point: List[int]) -> None:
        x,y = point[:2]
        self.dicx[x].append(y)
        self.dicy[y].append(x)
        self.dic[(x,y)] +=1
    def count(self, point: List[int]) -> int:
        a,b = point[:2]
        res = 0
        for y in self.dicx[a]:
            dis = abs(b-y)
            if dis >0:
                for x in [a-dis,a+dis]:
                   
                    res += self.dic[(x,b)]*self.dic[(x,y)]
        return res 

2047. 句子中的有效单词数

判断

class Solution:
    def countValidWords(self, sentence: str) -> int:

        words =sentence.split(' ')
        res = 0
        for word in words:
            flag=1
            glag =0
            if word:
                for a in range(len(word)):
                    if word[a]=='-' and a>0 and a<len(word)-1 and glag == 0 and flag == 1 and ord(word[a-1]) >=ord('a') and ord(word[a-1])<=ord('z')and ord(word[a+1]) >=ord('a') and ord(word[a+1])<=ord('z'):
                        glag =1
                        continue
                    if word[a] in ['!','.',',']and a==len(word)-1 and  flag ==1:
                        continue
                    if  ord(word[a]) <ord('a') or ord(word[a])>ord('z') :
                        flag = 0
                if flag ==1:
                    #print(word)
                    res+=1
        return res

正则

class Solution:
    def countValidWords(self, sentence: str) -> int:

      
    return sum(bool(re.match(r'[a-z]*([a-z]-[a-z]+)?[!.,]?$', w)) for w in sc.split())
。