Python学习笔记（二十六）——第四十九讲

0、

def rev(seq):

    len1 = len(seq)

    while len1 != 0:

        len1 -= 1

        yield seq[len1]

 

运行结果

>>> rev('love')

<generator object rev at 0x0000004FDE8D2DE0>

>>> for i in rev('love'):

     print(i,end='')

 

    

evol

>>>

 

 

1、

import math

def is_prime(number):

    if number > 1:

        if number == 2:

            return True

        if number % 2 == 0:

            return False

        for current in range(3, int(math.sqrt(number) + 1), 2):

            if number % current == 0:

                return False

        return True

    return False

 

 

def get_prime(number):

    while True:

        if is_prime(number):

            yield number

        number += 1

 

def solve():

    total = 2

    for i in get_prime(3):

        if i < 2000000:

            total += i

        else:

            print(total)

            return

 

solve()

运行结果

142913828922

>>>