Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 541065d

Browse files
committed
day-5
1 parent e6dc4c0 commit 541065d

File tree

1 file changed

+29
-0
lines changed

1 file changed

+29
-0
lines changed

‎merge-sorted-array.py‎

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
class Solution:
2+
def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
3+
"""
4+
Do not return anything, modify nums1 in-place instead.
5+
"""
6+
del nums1[m:len(nums1)]
7+
for i in range(n):
8+
nums1.append(nums2[i])
9+
nums1.sort()
10+
# i = j = 0
11+
# del nums1[m:len(nums1)]
12+
# while i < m and j < n:
13+
# if nums1[i] < nums2[j]:
14+
# nums1[i]=nums1[i]
15+
# i += 1
16+
# else:
17+
# i += 1
18+
# nums1.insert(i,nums2[j])
19+
# j += 1
20+
21+
# while j < n:
22+
# nums1.append(nums2[j])
23+
# j += 1
24+
25+
# return nums1
26+
27+
# nums1[m:]=nums2
28+
# return nums1.sort()
29+

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /