FilesExpand file tree

master

/

求二叉路径.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

27 lines (21 loc) · 558 Bytes

master

/

求二叉路径.py

Copy path

Top

File metadata and controls

• Code
• Blame

27 lines (21 loc) · 558 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

# -*- coding: utf-8 -*-

"""

Created on Fri Oct 26 12:52:53 2018

@author: Administrator

"""

triangle = [[-1],[3,2],[-3,1,-1]]

floor = 0

for i in triangle:

floor = floor + 1

if i == triangle[0]:

continue

if i == triangle[1]:

i[0] = i[0] + triangle[floor-2][0]

i[1] = i[1] + triangle[floor-2][0]

continue

length = len(i)

for j in range(length):

if j == 0:

i[j] = triangle[floor-2][j] + i[j]

else:

i[j] = min(triangle[floor-2][j],triangle[floor-2][j-1]) + i[j]