Discuss / Python / 加油干呐

加油干呐

Topic source

Pklue

#1 Created at ... [Delete] [Delete and Lock User]

def not_visiable():

    yield 1

    item = num_item()

    while True:

        n = next(item)

        yield n

        item = filter(is_palindrome, item)

def is_palindrome(n):    #过滤规则

    C = str(n)

    i = len(C)-1

    if C[i] == C[-1-i]:

        return True

def num_item():   #初始序列

    n = 1

    while True:

        n = n + 1

        yield n

Pklue

#2 Created at ... [Delete] [Delete and Lock User]

好像干了没必要的哈事

梦VS江楠

#3 Created at ... [Delete] [Delete and Lock User]

操作太复杂了

def odd_iter():    v = 0    while True:        v += 1        yield vdef is_palindrome(m):    n = str(m)    l = len(n)-1    return n[l] == n[-1-l]

梦VS江楠

#4 Created at ... [Delete] [Delete and Lock User]

emmm,发现复制多了。

def is_palindrome(m):    n = str(m)    l = len(n)-1    return n[l] == n[-1-l]

很好!虽然复杂,但学习一波~


  • 1

Reply