Data-Structures-and-Algorithms/Java/Leetcode-Median-of-2-sorted-arrays.java at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/Java/Leetcode-Median-of-2-sorted-arrays.java at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.6 (2917 reviews)
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
// Problem link : https://leetcode.com/problems/median-of-two-sorted-arrays/description

classSolution {
publicdoublefindMedianSortedArrays(int[] nums1, int[] nums2) {
intarr[]=newint[nums1.length+nums2.length];

intj=0;
inti=0;
intr=0;
while(i<nums1.length && j<nums2.length)
 {
if(nums1[i]<nums2[j])
 {
arr[r]=nums1[i];
i++;
r++;
 }
elseif (nums1[i]>nums2[j])
 {
arr[r]=nums2[j];
j++;
r++;
 }
else
 {
arr[r]=nums1[i];
r++;
arr[r]=nums2[j];
r++;
i++;
j++;
 }

 }
while(i<nums1.length)
 {
arr[r]=nums1[i];
r++;
i++;
 }
while(j<nums2.length)
 {
arr[r]=nums2[j];
r++;
j++;
 }
if(arr.length%2==0)
 {

doublea1= Double.valueOf( arr[arr.length/2]);
doublea2=Double.valueOf(arr[arr.length/2-1]);
doubled= (a1+a2)/2;
returnd;
 }
else
 {
returnDouble.valueOf(arr[arr.length/2]);
 }
}
}