【LeetCode】004. Median of Two Sorted Arrays
来源:互联网 发布:非诚勿扰杨宇航淘宝店 编辑:程序博客网 时间:2024/06/16 11:53
这题在LeetCode上标记的是Hard,也确实提交了好几次才 AC 的。效率也不高,最终成绩为:229ms , 22.3%。有很多边界条件需要考虑,细节问题应该也可以优化,只是没想到beats 这么低。
立下一个 flag,好好考虑JS的数组边界问题,跟第一JS相比,代码冗余太多
var findMedianSortedArrays = function(nums1, nums2) { var iMax = nums1.length; var jMax = nums2.length; var k = iMax + jMax; var mMax = Math.floor(k/2)+1; var INF = 10000; var mMax = Math.floor(k/2)+1; var min2 = min1 = (nums2[0]||INF) > (nums1[0]||INF)? (nums1[0]||INF) : (nums2[0]||INF); if( !(nums1.length) ){ return k%2 ? nums2[ mMax -1 ] : (nums2[mMax - 1] + nums2[mMax - 2])/2; } if( !(nums2.length) ){ return k%2 ? nums1[ mMax -1 ] : (nums1[mMax - 1] + nums1[mMax - 2])/2; } // k = k%2 ? [(k-1)/2] : [k/2 - 1,k/2]; for(var i = 0,j = 0, m = 0; m < mMax ; m++ ){ min2 = min1; if(i == iMax){ min2 = nums2[mMax - 2 - i] > min2 ? nums2[mMax - 2 - i] : min2 ; min1 = nums2[mMax - 1 - i];console.log(min2,min1,i,j); break; } if(j == jMax){ min2 = nums1[mMax - 2 - j] > min2 ? nums1[mMax - 2 - j] : min2; min1 = nums1[mMax - 1 - j]; break; } if( nums1[i] > nums2[j] ){ min1 = nums2[j]; j++; }else{ min1 = nums1[i]; i++; } } return k%2 ? min1 : (min1+min2)/2;};
阅读全文
0 0
- LeetCode 004. Median of Two Sorted Arrays
- leetcode--004. Median of Two Sorted Arrays
- LeetCode 004. Median of Two Sorted Arrays
- 【LeetCode】004. Median of Two Sorted Arrays
- LeetCode: Median of Two Sorted Arrays
- LeetCode Median of Two Sorted Arrays
- leetcode 26: Median of Two Sorted Arrays
- Leetcode 4 Median of Two Sorted Arrays
- [Leetcode] Median of Two Sorted Arrays
- LeetCode 4 - Median of Two Sorted Arrays
- [LeetCode]Median of Two Sorted Arrays
- leetcode Median of Two Sorted Arrays
- LeetCode-Median of Two Sorted Arrays
- [LeetCode] Median of Two Sorted Arrays
- [LeetCode] Median of Two Sorted Arrays
- [leetcode] Median of Two Sorted Arrays
- leetcode-004:Median of Two Sorted Arrays
- Leetcode 4 Median of Two Sorted Arrays
- python 学习笔记
- linux下的虚拟内存和分页分段机制
- HDU 6061 RXD and functions(NTT+卷积)
- Android 开发之初识Kotlin
- 剑指offer:树的子结构
- 【LeetCode】004. Median of Two Sorted Arrays
- Django中ORM模型总结(二)[模型类的对应关系,模型类的属性,字段类型]
- Java-HashMap踩坑小记
- Python——切片备忘
- 最大差值(2017某计算机校招笔试试题)
- 百度地图自定义覆盖物及创建多个小图标
- HDU 6075 Questionnaire【】
- 数学、计算机及抽象思维
- poj 1383 Labyrinth【bfs+队列】