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 33e4af5

Browse files
88. Merge Sorted Array (java)
1 parent 060d8b8 commit 33e4af5

File tree

1 file changed

+12
-0
lines changed

1 file changed

+12
-0
lines changed
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
class Solution {
2+
public void merge(int[] nums1, int m, int[] nums2, int n) {
3+
int index = m+n-1;
4+
int index1 = m-1;
5+
int index2 = n-1;
6+
while(index1>=0&&index2>=0){
7+
if (nums1[index1]<nums2[index2]) nums1[index--] = nums2[index2--];
8+
else nums1[index--] = nums1[index1--];
9+
}
10+
while(index2>=0) nums1[index--] = nums2[index2--];
11+
}
12+
}

0 commit comments

Comments
(0)

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