리트코드: Longest Palindromic Substring

/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number}
 */
var findMedianSortedArrays = function(nums1, nums2) {
    return medianValue(nums1, nums2); 
};

const medianValue = (nums1, nums2) => {
    const len = nums1.length + nums2.length;
    const median = parseInt(len / 2);
    let index = -1;
    let i = 0;
    let j = 0;
    let tmp = 0;
    let result = 0;
    while(true) {
        if( len % 2 == 1 && index == median) {
            return tmp;
        }

        if( len % 2 == 0 && index == median) {
            return (result + tmp) / 2;
        }

        if( len % 2 == 0 && index == median -1) {
            result = tmp;
        }

        if(i == nums1.length && j == nums2.length) {
            break;
        }else if(i == nums1.length) {
            tmp = nums2[j];
            j++;
        }
        else if(j == nums2.length) {
            tmp = nums1[i];
            i++;
        }
        else if(nums1[i] > nums2[j]) {
            tmp = nums2[j];
            j++;
        }else {
            tmp = nums1[i];
            i++;
        }
        index++;
    }
};