Guest User

Untitled

a guest
May 27th, 2018
83
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.67 KB | None | 0 0
  1. #Problem 17: Maximum path sum II
  2. def agac_olustur(path):
  3. dosya=open(path,"r")
  4. liste=[]
  5. liste=dosya.readlines()
  6. boyut=len(liste)
  7.  
  8. for i in range(boyut):
  9. liste[i]=liste[i].split()
  10. liste[i]=[int(z) for z in liste[i]]
  11. for y in range(boyut-1-i):
  12. liste[i].append(0)
  13. return liste
  14.  
  15. def en_buyuk_toplam(girdi):
  16. boyut=len(girdi)
  17. for y in range(boyut-2, -1, -1):
  18. for x in range(y+1):
  19. if girdi[y+1][x] > girdi[y+1][x+1]:
  20. girdi[y][x]+=girdi[y+1][x]
  21. else:
  22. girdi[y][x]+=girdi[y+1][x+1]
  23. return girdi[0][0]
  24.  
  25. sonuc=agac_olustur("aaa.txt")
  26. print(en_buyuk_toplam(sonuc))
Add Comment
Please, Sign In to add comment