Skip to content

Commit 4056659

Browse files
author
hariniparth
committed
Merge Sorted Arrays
1 parent 774c2d6 commit 4056659

7 files changed

Lines changed: 243 additions & 0 deletions

File tree

‎InterviewCake/MergeSortedArrays/.idea/description.html‎

Lines changed: 1 addition & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎InterviewCake/MergeSortedArrays/.idea/misc.xml‎

Lines changed: 12 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎InterviewCake/MergeSortedArrays/.idea/modules.xml‎

Lines changed: 8 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎InterviewCake/MergeSortedArrays/.idea/project-template.xml‎

Lines changed: 3 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎InterviewCake/MergeSortedArrays/.idea/workspace.xml‎

Lines changed: 172 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
<?xml version="1.0" encoding="UTF-8"?>
2+
<module type="JAVA_MODULE" version="4">
3+
<component name="NewModuleRootManager" inherit-compiler-output="true">
4+
<exclude-output />
5+
<content url="file://$MODULE_DIR$">
6+
<sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
7+
</content>
8+
<orderEntry type="inheritedJdk" />
9+
<orderEntry type="sourceFolder" forTests="false" />
10+
</component>
11+
</module>
12+
Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
package com.company;
2+
3+
public class Main {
4+
5+
public int[] mergeSortedArrays(int[] arr1, int[] arr2){
6+
7+
int[] arr3 = new int[];
8+
int i = 0, j = 0, k = 0;
9+
10+
while(i < arr1.length && j < arr2.length){
11+
if(arr1[i] < arr2[j]){
12+
arr3[k] = arr1[i];
13+
i++;
14+
} else {
15+
arr3[k] = arr2[j];
16+
j++;
17+
}
18+
k++;
19+
}
20+
21+
while(i < arr1.length){
22+
arr3[k] = arr1[i];
23+
i++;
24+
k++;
25+
}
26+
27+
while(j < arr2.length){
28+
arr3[k] = arr2[j];
29+
i++;
30+
k++;
31+
}
32+
33+
return arr3;
34+
}
35+
}

0 commit comments

Comments
 (0)