[JS做LeetCode] Median of Two Sorted Arrays

Median of Two Sorted Arrays

<html>

<head>
    <meta http-equiv="charset" content="utf-8"></head>

<body>
    <script>
        //解题思路：
        //找出中位数要循环的次数为loop
        //posA为数组A的下标，posB为数组B的下标
        //每次循环找出两个数组对应下标比较小的值，进栈，下标+1
        //注意判断数组为空的情况

        var A = [0,1,4,8];
        var B = [2,7,9,10];
        var findMedianSortedArrays = function(A, B) {
                var m = A.length;
                var n = B.length;
                var loop = Math.floor((m+n)/2)+1;
                var posA = 0;
                var posB = 0;
                var stack = [];

                for(var i=0; i<loop; i++) {
                        if(posA === m) {
                                stack.push(B[posB]);
                                posB++;
                                continue;
                        }
                        if(posB === n) {
                                stack.push(A[posA]);
                                posA++;
                                continue;
                        }
                        if(A[posA]<B[posB]) {
                                stack.push(A[posA]);
                                posA++;
                        } else {
                                stack.push(B[posB]);
                                posB++;
                        }
                }
                if((m+n)%2 === 0) {
                        return (stack.pop()+stack.pop())/2;
                } else {
                        return stack.pop();
                }
        };

        alert(findMedianSortedArrays(A, B));
    </script></body>

时间： 2025-01-05 23:26:55

[JS做LeetCode] Median of Two Sorted Arrays的相关文章

LeetCode——Median of Two Sorted Arrays

There are two sorted arrays A and B 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)). 有两个已排序的数组A和B,大小为m 和 n. 找出两数组的中位数时间复杂度应该为 O(log (m+n)). 简单粗暴的方法就是把两个数组合并成一个数组,排序,取中位数.

[leetcode]Median of Two Sorted Arrays @ Python

原题地址:https://oj.leetcode.com/problems/median-of-two-sorted-arrays/ 题意:There are two sorted arrays A and B 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)). 解题思路:这道题要求两个已经排好

[LeetCode] Median of Two Sorted Arrays [16]

题目 There are two sorted arrays A and B 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)). 原题链接(点我) 解题思路返回两个排序数组的中位数.这个题可以有以下几个思路: 首先可以想到的是将两个数组merge起来,然后返回其中位数. 第二个是,类似merg

leetcode | Median of Two Sorted Arrays 寻找2个有序数组中第k大的值

问题 Median of Two Sorted Arrays There are two sorted arrays A and B 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)). 分析本题更经典通用的描述方式时: 给定2个有序数组,找出2个数组中所有元素中第k大的元素. 思路1 直观思

LeetCode—Median of Two Sorted Arrays

Median of Two Sorted Arrays 这道题要找Median,中位数.这个是指,如果数组大小是偶数,返回中间两个数的平均值,如果是奇数个,就是中间的数. 算法时间效率要求是 O(log(m + n)),具体思路网上都一样. 另外,现在leetCode的C++ 数组都换成vector了,所以只好整理一下vector的用法. 参考:http://imatlab.lofter.com/post/286ffc_a81276 http://www.cnblogs.com/wang7/ar

[LeetCode] Median of Two Sorted Arrays 解题报告

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)). Subscribe to see which companies asked this question Show Tags 分析: 这个题目在leetco

[LeetCode] Median of Two Sorted Arrays 两个有序数组的中位数

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)). http://www.acmerblog.com/leetcode-median-of-two-sorted-arrays-5330.html http:/

(Leetcode) Median of Two Sorted Arrays (Hard)

題目: 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)). Code: 1 class Solution 2 { 3 public: 4 double findMedianSortedArrays(vecto

[LeetCode]Median of Two Sorted Arrays查找第k数（中位数）

二分.情况讨论 class Solution { public: int findPos(int* p,int n,int x){ int low=0,high=n-1,mid; while(low<=high){ mid=(low+high)>>1; if(p[mid]<=x)low=mid+1; else high=mid-1; } return low; } double findK(int a[], int m, int b[], int n,int k){ int mid