我如何在下面实现这些算法 [英] How do i implement these algorithms below
问题描述
算法1:
获取数字L1,L2,L3 .... LN的列表作为参数
假设L1最大,最大= L1
从列表中选取下一个数字Li,然后执行以下操作
如果Largest小于Li < br>
最大= Li
如果Li是列表中的最后一个数字,则
返回最大并出来
其他重复相同的过程从步骤3
Get a list of numbers L1, L2, L3....LN as argument
Assume L1 is the largest, Largest = L1
Take next number Li from the list and do the following
If Largest is less than Li
Largest = Li
If Li is last number from the list then
return Largest and come out
Else repeat same process starting from step 3
算法2:
创建一个执行以下操作的函数prime_number
以整数和
作为参数,如果值是质数或
$ b,则返回布尔值true $ b返回布尔值false,如果该值不是素数
Create a function prime_number that does the following
Takes as parameter an integer and
Returns boolean value true if the value is prime or
Returns boolean value false if the value is not prime
到目前为止,我的代码是:
So far my code is :
def get_algorithm_result(num_list):
largest =num_list[0]
for item in range(0,len(num_list)):
if largest < num_list[item]:
largest = num_list[item]
return largest
def prime_number(integer):
if integer%2==0:
return False
else:
return True
执行代码后,我得到
"Test Spec Failed
Your solution failed to pass all the tests"
我要去哪里错了?
推荐答案
def get_algorithm_result(numb):
largest = numb[0]
for Li in numb:
if largest < Li:
largest = Li
if Li == numb[-1]:
return largest
else:
continue
def prime_number(primes):
if primes > 1:
for i in range(3, primes):
if (primes % i) == 0:
return False
else:
return True
else:
return False
这篇关于我如何在下面实现这些算法的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!