Python代码集合

查询 n 到 m 间的所有素数

def find_prime_number(n, m):
    if isinstance(n, int) and isinstance(m, int):
        if m <= 1:
            return "error range"
        if 1 >= n > m:
            return "error start"
        numbers = list()
        num = n
        while num <= m:
            i = 2
            while i < num:
                if (num % i == 0) and (num != i):
                    break
                else:
                    i += 1
            if num == i:
                numbers.append(num)
            num += 1
        return numbers
    else:
        return "error input"
print(find_prime_number(1, 100))

猜数字游戏

# Import the random package
import random

def askPlayer():
    """
    Ask player to enter a number

    Output:
      * playerNumber: the number entered by the player, or None if the player wants to stop the game
    """

    while True:
        # Player input
        word = input("What is the magic number? ")
        # Quit if the player types "quit"
        if word == "quit":
            return None

        # Int casting with exception handling
        try:
            playerNumber = int(word)
            break
        except ValueError:
            print("Please type a number without decimals!")
            continue

    return playerNumber


def runGame():
    # Generate a random Magic number
    magicNumber = random.randint(1,10)
    # An integer to count the guesses
    guessCount = 0
    while True:
        playerNumber = askPlayer()
        if playerNumber is None:
            break        
        # Increase the number of guesses
        guessCount += 1

        # Cases
        if playerNumber == magicNumber:
            print("This is correct! You win!")
            print("You guessed the magic number in {} guesses.".format(guessCount))
            break
        elif magicNumber < playerNumber:
            print("The magic number is lower")
        elif magicNumber > playerNumber:
            print("The magic number is higher")

        # Wrong number, continue 
        print("This is not the magic number. Try again!")


runGame()

一摞Python风格的卡牌

import collections
from random import choice
 
Card = collections.namedtuple('Card', ['rank', 'suit'])
 
class FrenchDeck:
    ranks = [str(n) for n in range(2, 11)] + list('JQKA')
    suits = 'spades diamonds clubs hearts'.split()
 
    def __init__(self):
        self._cards = [Card(rank, suit) for suit in self.suits
                                        for rank in self.ranks]
 
    def __len__(self):
        return len(self._cards)
 
    def __getitem__(self, position):
        return self._cards[position]

    def rChoice(self):
        return choice(self)

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值