FilesExpand file tree

 master

/

088_Merge_Sorted_Array.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

38 lines (37 loc) · 1.06 KB

 master

/

088_Merge_Sorted_Array.py

Copy path

Top

File metadata and controls

• Code
• Blame

38 lines (37 loc) · 1.06 KB

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

class Solution(object):

def merge(self, nums1, m, nums2, n):

"""

:type nums1: List[int]

:type m: int

:type nums2: List[int]

:type n: int

:rtype: void Do not return anything, modify nums1 in-place instead.

"""

p1, p2 = m - 1, n - 1

pos = m + n - 1

while p1 >= 0 and p2 >= 0:

if nums1[p1] >= nums2[p2]:

nums1[pos] = nums1[p1]

p1 -= 1

else:

nums1[pos] = nums2[p2]

p2 -= 1

pos -= 1

while p2 >= 0:

nums1[pos] = nums2[p2]

p2 -= 1

pos -= 1

# def merge(self, nums1, m, nums2, n):

# # using slicing

# i, j, k = m - 1, n - 1, m + n - 1

# while i >= 0 and j >= 0:

# if nums1[i] > nums2[j]:

# nums1[k] = nums1[i]

# i -= 1

# else:

# nums1[k] = nums2[j]

# j -= 1

# k -= 1

#

# if j >= 0:

# nums1[:k + 1] = nums2[:j + 1]