Information

Sajt

29 Minmax

Gör en minmax algorithm för värden i listor. I varje steg skriv ut vad som händer. Se testfallen.

Test

Case 0 


> [0]
-> 0 # 0
0

Test 1 


> [1,2,3]
-> 0 # 1
-> 1 # 2
-> 2 # 3
3

Test 2 


> [1,[2,3]]
-> 0 # 1
-> 1 -> 0 # 2
-> 1 -> 1 # 3
-> 1 # 2
2

Test 3 


> [1,[[2,3],4]]
-> 0 # 1
-> 1 -> 0 -> 0 # 2
-> 1 -> 0 -> 1 # 3
-> 1 -> 0 # 3
-> 1 -> 1 # 4
-> 1 # 3
3

Test 4 


> [[6,[1,5]],[[2,3],[4,5]]]
-> 0 -> 0 # 6
-> 0 -> 1 -> 0 # 1
-> 0 -> 1 -> 1 # 5
-> 0 -> 1 # 5
-> 0 # 5
-> 1 -> 0 -> 0 # 2
-> 1 -> 0 -> 1 # 3
-> 1 -> 0 # 3
-> 1 -> 1 -> 0 # 4
-> 1 -> 1 -> 1 # 5
-> 1 -> 1 # 5
-> 1 # 3
5

Nyheter