擅长:python、mysql、java
<p>我已经更新了你的代码,所以它可以显示多辆最快的车。最终可能会有成吨的汽车,而且可能不止一辆拥有相同的cc</p>
<p>如果你有任何问题,请在评论中告诉我</p>
<p>欢迎使用堆栈溢出</p>
<pre><code>class car:
category = 'auto'
def __init__(self,brand,color,cc):
self.brand = brand
self.color = color
self.cc = cc
def fastest(cars):
max_cc = max([car.cc for car in cars])
fastest_cars = [car for car in cars if car.cc == max_cc]
return fastest_cars
NissanCar = car("Nissan","red",1800)
MercedesCar = car("Mercendes","gold",1600)
LamborghiniCar = car("Lamborghini","green",3000)
fastest_cars = fastest([NissanCar, MercedesCar, LamborghiniCar])
for fastest_car in fastest_cars:
print(f"The fastest car is {fastest_car.brand} with {fastest_car.cc} cc")
</code></pre>