Python 帮助：特殊数字总数

Question

我正在编写查找特殊数字（1-10 之间的质数）和代码函数的代码，但我希望它列出有多少个数字。现在它说：

Enter smaller number (m): 4
Enter the larger number (n): 7
Special numbers: [5, 7]
Special numbers Brute force: [5, 7] 

但是我想让它说“特殊数字= 2：[5,7]”。

我尝试添加 if 语句，但不知道如何将其添加到我的代码中，我将在下面列出代码。

def main():
    m = int(input("Enter smaller number (m): "))
    n = int(input("Enter the larger number (n): "))
    if m >= n:
        print("Error: First number should be smaller than second")
    special_nums = locate_special_numbers(m, n)

    if len(special_nums) <= 5:
        print("Special numbers are:", special_nums)
    else:
        first_three = special_nums[:3]
        last_three = special_nums[-3:]
        print("First three smallest special numbers:", first_three)
        print("Last three biggest special numbers:", last_three)

    # Brute force approach
    special_numbers_brute_force = locate_special_numbers(m, n)
    print("Special numbers Brute force:", special_numbers_brute_force)


# lines 33-39 are not executing as expected
def amount_of_special_numbers(m, n):
    amount_of_special_numbersList = []
    for num in range(m, n + 1):
        if prime(num) and mirrored(num):
            amount_of_special_numbersList.append(num)
            print(
                "The total number of special number is:",
                len(amount_of_special_numbersList),
            )
            # Return the list after the first special number is found
            return amount_of_special_numbersList


if __name__ == "__main__":
    main()

Answer 1

我稍微改变了你的代码并编写了

is_prime(num)

和

locate_special_numbers(m, n)

函数。

def is_prime(num):
    if num < 2:
        return False
    for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            return False
    return True

def locate_special_numbers(m, n):
    prime_numbers = []
    for num in range(m, n + 1):
        if is_prime(num):
            prime_numbers.append(num)
    return prime_numbers

def main():
    m = int(input("Enter smaller number (m): "))
    n = int(input("Enter the larger number (n): "))
    if m >= n:
        print("Error: First number should be smaller than second")
    special_nums = locate_special_numbers(m, n)

    if len(special_nums) <= 5:
        print("Special numbers are:",len(special_nums), ":", special_nums)
    else:
        first_three = special_nums[:3]
        last_three = special_nums[-3:]
        print("First three smallest special numbers:", first_three)
        print("Last three biggest special numbers:", last_three)

    # Brute force approach
    special_numbers_brute_force = locate_special_numbers(m, n)
    print("Special numbers Brute force:", special_numbers_brute_force)

if __name__ == "__main__":
    main()

这给了我以下输出：

Enter smaller number (m): 4
Enter the larger number (n): 7
Special numbers are: 2 : [5, 7]
Special numbers Brute force: [5, 7]

正如您在代码中看到的，

print("Special numbers are:",len(special_nums), ":", special_nums)

适合您。如果你想使用格式化字符串

print("Special numbers are: %d" %len(special_nums), ":", special_nums)

也可以工作，尽管它会更难理解。 希望这有帮助！