AlgorithmsAndLeetCodeQuestions/src/leetcode/medianOfTwoSortedArray/Solution.java at main · Luca5Eckert/AlgorithmsAndLeetCodeQuestions · GitHub

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
61
package leetcode.medianOfTwoSortedArray;

class Solution {

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

        int lengthN = nums1.length;
        int lengthM = nums2.length;

        int n = 0;
        int m = 0;

        int lengthTotal = lengthN + lengthM;
        int mid = 0;
        int mid2 = 0;

        for(int i = 0; i < (lengthTotal/2)+1; i++ ){
            mid2 = mid;

            if(n < lengthN && m < lengthM ){
                if(nums1[n] < nums2[m]){
                    mid = nums1[n];
                    n++;
                } else {
                    mid = nums2[m];
                    m++;
                }

            } else if ( n < lengthN ){
                mid = nums1[n];
                n++;
            } else {
                mid = nums2[m];
                m++;
            }


        }

        if(lengthTotal % 2 == 0){
            return (double) (mid2 + mid) / 2;
        }

        return mid;
    }

    public static void main(String[] args) {
        Solution s = new Solution();

        int[] nums1 = {1,2};
        int[] nums2 = {3,4};

        double resultExpected = 2.5;

        double result = s.findMedianSortedArrays(nums1, nums2);

        System.out.println("RESULT EXPECTED: " + resultExpected);
        System.out.println("RESULT: " + result );

    }
}