Python基礎學習代碼之條件和迴圈

來源:互聯網
上載者:User
def func1():    alist = ['Cathy','Terry','Joe','Health','Lucy']    for i in  range(-1,-len(alist)-1,-1):        print i,alist[i]def func2():    alist = ['Cathy','Terry','Joe','Health','Lucy']    for i,name in enumerate(alist):        print '%d %s' % (i,name)import randomdef func3():    alist = ['Cathy','Terry','Joe','Health','Lucy']    blist = [random.randint(i,10) for i in range(5)]    for a,b in zip(alist,blist):        print a,bdef func4():    num = 4    count = num / 2    while count > 0:        if num % count == 0:            print count,'is the largest factor of',num            break        count -= 1def showmaxfactor(num):    count = num / 2    while count > 1:        if num % count == 0:            print num,'largest factor is',count            break        count -= 1        return True    else:        print num,'is prime'        return Falsedef func5():    for eachnum in range(10,60):        showmaxfactor(eachnum)def func6():    alist = range(5)    return map(lambda x: x ** 2,alist)def func7():    alist = [x ** 2 for x in range(5)]    return alistdef func8():    return filter(lambda x:x % 2,range(10))def func9():    return [x for x in range(10) if x % 2]def func10():    return [(x+1,y+1) for x in range(3) for y in range(5)]import osdef func11():    f = open('Client.py','r')    print os.stat('Client.py').st_size    print len([word for line in f for word in line.split(' ')])    f.seek(0)    print sum([len(word) for line in f for word in line.split(' ')])def cols():    yield 3    yield 5def func12():    alist = [1,2,4,6]    x = ((i,j) for i in alist for j in cols())    for a in x:        print adef func13():    f = open('Client.py','r')    longest = 0    alllines = f.readlines()    f.close()    for line in alllines:        linelen = len(line.strip())        if linelen > longest:            longest = linelen    return longestdef func14():    f = open('Client.py','r')    alllinelen = [len(x.strip()) for x in f]    f.close()    return max(alllinelen)def func15():    return max(len(x.strip()) for x in open('Client.py','r'))def func16(x,y,z):    alist = []    for i in range(x,y+1,z):        alist.append(i)    return alistdef getfactors(num):    for i in range(1,num+1):        if num % i == 0:            print idef isperfect(num):    sum = 0    count = num / 2    while count > 0:        for i in range(1,count+1):            if num % i == 0:                sum += i            count -= 1    if sum == num:        return True    else:        return Falsedef fibonacci(num):    if num == 1:        return [1]    if num == 2:        return [1,1]    list = [1,1]    if num > 2:        for i in  range(3,num+1):            list.append(list[-1]+list[-2])        return listdef convert():    start = int(raw_input(u'請輸入起始值:'))    end = int(raw_input(u'請輸入結束值:'))    for i in range(start,end+1):        print "dec  bin  oct   hex"        print '-' * 20        print "%d  %s  %s  %s" % (i,bin(i),oct(i),hex(i))

以上就是Python基礎學習代碼之條件和迴圈的內容,更多相關內容請關注topic.alibabacloud.com(www.php.cn)!

  • 聯繫我們

    該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

    如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

    A Free Trial That Lets You Build Big!

    Start building with 50+ products and up to 12 months usage for Elastic Compute Service

    • Sales Support

      1 on 1 presale consultation

    • After-Sales Support

      24/7 Technical Support 6 Free Tickets per Quarter Faster Response

    • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.