FilesExpand file tree

 master

/

LeetCode4.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

37 lines (33 loc) · 1.06 KB

 master

/

LeetCode4.java

Copy path

Top

File metadata and controls

• Code
• Blame

37 lines (33 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

package LeetCode.array;

/**

* There are two sorted arrays nums1 and nums2 of size m and n respectively.

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

*/

public class LeetCode4 {

public double findMedianSortedArrays(int[] nums1, int[] nums2) {

int n1 = nums1.length;

int n2 = nums2.length;

int[] nums = new int[n1+n2];

int i = 0, j = 0, k=0;

while(k < n1+n2){

if(i >= n1) {

while(j < n2){

nums[k++] = nums2[j++];

}

} else if(j >= n2){

while(i < n1){

nums[k++] = nums1[i++];

}

} else if(nums1[i] < nums2[j]){

nums[k++] = nums1[i++];

} else {

nums[k++] = nums2[j++];

}

}

if ((nums.length & 1) == 0){

return (nums[(n1+n2)/2] + nums[(n1+n2)/2-1] + 0.0)/2;

} else {

return nums[(n1+n2)/2];

}

}

}