[英]Finding the minimum from a nested list using recursion
I am trying to write a function to find the minimum value of a nested list.我正在尝试编写一个函数来查找嵌套列表的最小值。 I have written code but get the error that I cannot use < between an integer and a list.
我已经编写了代码,但得到了不能在整数和列表之间使用 < 的错误。 Any ideas?
有任何想法吗? I cannot use any built-in functions.
我不能使用任何内置函数。
def minimumVal(Y):
if len(Y) == 1:
return Y[0]
minimum = Y[0]
if minimum < minimumVal(Y[1:]):
return minimum
else:
return minimumVal(Y[1:])
My first thought would be to collapse the list with itertools but since you can't use built in functions, here's a scrappy method that works:我的第一个想法是使用 itertools 折叠列表,但由于您不能使用内置函数,因此这里有一个有效的方法:
l = [2, 3, 4, 5, 6, [3, 4, 5, 10], [15, 4, 9, 8]]
minimum = []
for sublist in l:
try:
for num in sublist:
if len(minimum) == 0:
minimum.append(num)
else:
if num < minimum[0]:
minimum[0] = num
except:
if len(minimum) == 0:
minimum.append(sublist)
else:
if sublist < minimum[0]:
minimum[0] = num
print(minimum[0])
output: 2
输出:2
if you can't use len(), here's another option with more tries/excepts:如果您不能使用 len(),这里有更多尝试/例外的另一个选项:
l = [2, 3, 4, 5, 6, [3, 4, 5, 10], [15, 4, 9, 8]]
minimum = []
for sublist in l:
try:
for num in sublist:
try:
if num < minimum[0]:
minimum[0] = num
except IndexError:
minimum.append(num)
except:
try:
if sublist < minimum[0]:
minimum[0] = sublist
except IndexError:
minimum.append(sublist)
print(minimum[0])
output: 2
输出:2
Last option, if you can't use the built in function for append you can do this:最后一个选项,如果你不能使用内置函数进行 append 你可以这样做:
l = [3, 4, 5, 6, 2, [3, 4, 5, 10], [15, 4, 9, 8]]
minimum = ['place holder']
for sublist in l:
try:
for num in sublist:
if minimum[0] != 'place holder':
if num < minimum[0]:
minimum[0] = num
else:
minimum[0] = num
except:
if minimum[0] != 'place holder':
if sublist < minimum[0]:
minimum[0] = sublist
else:
minimum[0] = sublist
print(minimum[0])
output: 2
输出:2
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.