FilesExpand file tree

 master

/

maximumsumpathtwoarrays.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

46 lines (38 loc) · 1016 Bytes

 master

/

maximumsumpathtwoarrays.py

Copy path

Top

File metadata and controls

• Code
• Blame

46 lines (38 loc) · 1016 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

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

# http://www.geeksforgeeks.org/maximum-sum-path-across-two-arrays/

def max_sum(input1, input2):

max_sum = 0

i = 0

j = 0

sum1 = 0

sum2 = 0

while i < len(input1) and j < len(input2):

if input1[i] == input2[j]:

if sum1 > sum2:

max_sum += sum1 + input1[i]

else:

max_sum += sum2 + input2[j]

i = i + 1

j = j + 1

sum1 = 0

sum2 = 0

elif input1[i] < input2[j]:

sum1 += input1[i]

i = i + 1

else:

sum2 += input2[j]

j = j + 1

while i < len(input1):

sum1 += input1[i]

i = i + 1

while j < len(input2):

sum2 += input2[j]

j = j + 1

if sum1 > sum2:

max_sum += sum1

else:

max_sum += sum2

return max_sum

if __name__ == '__main__':

input1 = [2, 3, 7, 10, 12, 15, 30, 34]

input2 = [1, 5, 7, 8, 10, 15, 16, 19]

print(max_sum(input1, input2))