所做更改：

(1)创建了res作为存储孪生素数的列表
(2)内部for循环的迭代是从i+1到end

代码：-

lst = input("Enter the numbers: ")
test_list =[]

for ele in lst.split():
    n_int = int(ele)
    test_list.append(n_int)

def prime(x):
    for k in range(2, x):
        if x%k == 0:
            return False
    return True

diff = 0
res=[]
for i in range(len(test_list)):
    for j in range(i+1,len(test_list)):
        if prime(test_list[i]) and prime(test_list[j]):
            diff = abs(test_list[i]-test_list[j])
            if diff == 2:
                res.append([test_list[i],test_list[j]])
if res: 
    for i,j in res:
        print(i,j)
else:
    print("No any twin primes")

输出：-

Enter the numbers: 3 4 5 7 8
3 5
5 7

Enter the numbers: 2 3 7 9
No any twin primes

下面是我的尝试：

def twinPrimes(iter):
    primes = []
    res = []
    for i in iter:
        for j in range(2, int(i/2)+1):
            if i % j == 0:
                break
        else:
            primes.append(i)
    for i in range(len(primes)-1):
        if primes[i+1] - 2 == primes[i]:
            res.append((primes[i], primes[i+1]))
    if res == []:
        return "No any twin primes"
    else:
        return res
print(twinPrimes([3,5,7]))

您还可以更改返回打印，如下所示：

def twinPrimes(iter):
    primes = []
    res = []
    for i in iter:
        for j in range(2, int(i/2)+1):
            if i % j == 0:
                break
        else:
            primes.append(i)
    for i in range(len(primes)-1):
        if primes[i+1] - 2 == primes[i]:
            res.append((primes[i], primes[i+1]))
            print(primes[i], primes[i+1])
    if res == []:
        print("No any twin primes")

输入：twinPrimes([3,5,7])
输出：

3 5
5 7

输入：twinPrimes([2,5,9])
输出：

No any twin primes