7.18

1.第一题：

我还是那么暴力没有一点进步：

class Solution:
    def isHappy(self, n: int) -> bool:
        m=0
        result=[]
        def sumss(n):
            a=0
            sums=0
            while n:
                a=n%10
                sums+=a*a
                n=n//10
            return sums
        while n:
            m=sumss(n)
            if m==1:
                return True
            else:
                if m in result:
                    return False
                result.append(m)
                n=m
        return False

2.第二题：

简单粗暴：

class Solution:
    def removeElements(self, head: ListNode, val: int) -> ListNode:
        p=head
        if head==None:
            return 0
        while head and head.val==val:
            head=head.next
            p=head
        while p and p.next:
            if p.next.val==val:
                p.next=p.next.next
            else:
                p=p.next
        return head

3.第三题：

class Solution:
    def countPrimes(self, n: int) -> int:
        if n<3:
            return 0
        else:
            output=[1]*n
            output[0],output[1]=0,0
            for i in range(2,int(n**0.5)+1):
                if output[i]==1:
                    output[i*i:n:i]=[0]*len(output[i*i:n:i])
        
        return sum(output)