使用while循環（蟒蛇）

Question

我已經試過這個代碼列表中找到數量最多：

numbers = [1,2,5,8,4,99,3] 

x = 0 

while numbers[x+1] > numbers[x]: 
    x = x+1 

print numbers[x] 

輸出是8

Howcan我解決這個問題？

Answer 1

試試這個：

numbers = [1,2,5,8,4,99,3] 

x = 0 
lar = numbers[x] 
while x < len(numbers): 
    if numbers[x] > lar: 
    lar = numbers[x] 
    x = x+1 
print lar 

Answer 2

a = [1,2,5,8,4,99,3] 
x = 0 
y = 0 

while y != len(a): 
    if x < a[y]: 
     x = a[y] 
    y += 1 

print x